Factoring and decomposing ore polynomials over Fq(t)

Authors:
Mark Giesbrecht;Yang Zhang
Affiliations:
University of Waterloo, Waterloo, Ontario, Canada;University of Western Ontario, London, Ontario, Canada
Venue:
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Year:
2003

Citing 8
Cited 4

An introduction to pseudo-linear algebra

Selected papers of the conference on Algorithmic complexity of algebraic and geometric models
Rational solutions of the mixed differential equation and its application to factorization of differential operators

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Factorization of differential operators with rational functions coefficients

Journal of Symbolic Computation
A subresultant theory for Ore polynomials with applications

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Factoring in skew-polynomial rings over finite fields

Journal of Symbolic Computation
FFT-like multiplication of linear differential operators

Journal of Symbolic Computation
Factoring in Skew-Polynomial Rings

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Factorization of differential systems in characteristic p

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

Factorization of differential systems in characteristic p

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Decomposition of differential polynomials with constant coefficients

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Decomposition of ordinary difference polynomials

Journal of Symbolic Computation
Fast computation of common left multiples of linear ordinary differential operators

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms for computing factorizations and least common left multiple (LCLM) decompositions of Ore polynomials over Fq(t), for a prime power q=pμ. Our algorithms are effective in Fq(t)[D; σ,δ], for any automorphism σ and σ-derivation δ of Fq(t). On input f ∈ Fq(t)[D;σ,δ], the algorithms run in time polynomial in degD(f), degt(f), p and μ.