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
Wenn Proteomik-Daten auf räumliches Verständnis treffen: Mein Einstieg in die VR-Molekularbiologie mit NexoPeek
0dev.to Data
Sabal Center Shooting: 2 Dead at Citibank Campus in Florida
0dev.to News
Nintendo Switch cartridge supplier Macronix to phase out ROM production
0dev.to News
Post-Purchase One-Click Upsell Math for Shopify: Auditing Second Card Fees, 3PL Extra Picks & the 16oz Shipping Cliff
0dev.to Productivity
What I Learned Evaluating AI Image, Video and Audio Models
0dev.to Career
What a small-business website costs in Canada in 2026 and how to estimate yours
0dev.to Beginners