AI & ML
Cyclotomic polynomials with trinomial irreducible factors over finite fields
arXiv math.IT0 views
arXiv:2611.00647v2 Announce Type: replace-cross Abstract: We classify the pairs $(q,n)$, where $q$ is a prime power, $n>1$, and $\gcd(n,q)=1$, for which every irreducible factor of $\Phi_n(x)$ over $\F_q$ has exactly three nonzero terms. The positive support exponents of these factors have a common greatest common divisor, which gives a unique reduction by a power substitution. The reduced degree is two in odd characteristic and belongs to $\{2,3,4\}$ in characteristic two; the cubic and quartic cases arise by scalar substitution from the layers of orders $7$ and $15$. This yields necessary and sufficient arithmetic conditions on $(q,n)$ and explicit factorizations. Among the classified families, precisely those arising from quartic bases have a divisor layer containing an irreducible factor with more than three terms.
Source:https://arxiv.org/abs/2611.00647PreviousOptimality of the $D_4$ lattice quantizerNextHow to reconcile Stripe payments in a double-entry ledger
Related posts
DevRev delivers autonomous self-service with GPT-6.1 Sol
0OpenAI Blog
A thousand fewer paths to root
0OpenAI Blog
Ted Cruz aims to stack FCC with Republicans before Democrats take Senate control
0Ars Technica

17 better ways Elon Musk could have wasted $446 million
0The Verge
Snapchat surpasses 30M paid subscribers
0TechCrunch
Almost no one uses AI agents to book their Uber, company says
0TechCrunch