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

X says its updated web app is way faster
0The Verge
What Is an AI Employee? The 2026 Guide for Small Businesses
0dev.to
Testing a chatbot before launch: an Article 50 test script
0dev.to

메일의 읽음 상태를 승인 플래그로 쓰지 않기: 전달·검토·결정 분리
0dev.to
Moz Domain Authority: a Directional Signal, Not a Report Card
0dev.to

Tiny's new AI workstation is anything but — packing in 16 TB SSD array and 128 GB GPU memory, but with an eye-watering price tag to boot
0TechRadar