English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We show that the effective factorization of Ore polynomials over$\mathbb{F}_q(t)$ is still an open problem. This is so because the knownalgorithm in [1] presents two gaps, and therefore it does not cover all theexamples. We amend one of the gaps, and we discuss what kind of partialfactorizations can be then computed by using [1].

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