Factoring Ore polynomials over \mathbbF_q(t) is difficult

2015/05/27 by Jose Gomez-Torrecillas, Gomez-Torrecillas, Jose, F. J. Lobillo +3
Mathematics · #16S36 #16Z05 #FOS: Mathematics #Rings and Algebras (math.RA) #math.RA #msc:16S36 #msc:16Z05

paper · pdf · doi:10.48550/arxiv.1505.07252

arxiv created 2015/05/27 · arxiv updated 2015/05/28

Abstract

We show that the effective factorization of Ore polynomials over \mathbbF_q(t) is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of the gaps, and we discuss what kind of partial factorizations can be then computed by using [1].

Related

• Computing the bound of an Ore polynomial. Applications to factorization
• Polynomial factorization over henselian fields
• Single-factor lifting and factorization of polynomials over local fields
• Improvements on Cantor-Zassenhaus Factorization Algorithm
• An algorithm for factoring non-monic quadratic polynomials Or: How I learned to stop using the quadratic formula and love undoing FOIL