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

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

Report: Apple and Samsung outperform rivals as smartphone chip shipments tumble 21%
09to5Mac
The Sandbox Fights Back: Joe Security Launches Adaptive Detonation
0HackerNoon
We Stopped Feeding LLMs Raw HTML: Cutting Agent Scraping Costs by 74% Across 10,000 Targets
0HackerNoon

What Happens When the Model Reads It Wrong: Building LLM Compliance Review That Survives an Audit
0HackerNoon
The Blue Wave Has Tech Bros Scrambling for Data Centers in Space
0Wired