Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult
Rings and Algebras
2015-05-28 v1
Abstract
We show that the effective factorization of Ore polynomials over 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].
Cite
@article{arxiv.1505.07252,
title = {Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult},
author = {Jose Gomez-Torrecillas and F. J. Lobillo and Gabriel Navarro},
journal= {arXiv preprint arXiv:1505.07252},
year = {2015}
}