Loading...
Please wait, while we are loading the content...
Similar Documents
Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gómez-Torrecillas, José Lobillo, F. J. Navarro, Gabriel |
| Copyright Year | 2015 |
| Abstract | 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]. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1505.07252v1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
