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
Agentic RAG over Alfresco without another vector database
0dev.to OpenSource
The model proposes, the code decides: automatic diagnosis of dbt failures with draft pull requests
0dev.to OpenSource
Why Top AI Companies Are Replacing Prompt Engineers with Forward Deployed AI Engineers (FDEs)
0dev.to Programming
La Quest 2 s'éteint : concevoir un visualiseur PDB VR indépendant du matériel
0dev.to Programming
Moonshot AI's Kimi K3.1 Pro Weights Are Now Open — Explained Honestly
0dev.to AI

Everyone has better models. Why do some teams fly while others don't?
0dev.to AI