Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult

preprint2015arXivOpen access

We show that the effective factorization of Ore polynomials over $\mathbb{F}_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].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Factoring Ore polynomials over Fq(t)\mathbb{F}_q(t)Fq​(t) is difficult

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult