Overview
- Which degrees force every Littlewood polynomial to be irreducible modulo two?
- What is proved for random Littlewood polynomials in degrees 2ʳ − 1?
- What remains open when the degree is unrestricted?
The sign model
A Littlewood polynomial is , with . In the random model, the signs are independent and fair. Multiplying by the leading sign preserves the roots and irreducibility and yields a monic polynomial whose remaining signs are again independent and fair.
By the rational-root theorem, the only possible rational roots are and . If is even, and are both sums of an odd number of odd integers and therefore do not vanish. For , counting sign patterns gives
The event at has the same probability. The two events are dependent. A reducibility estimate must also account for factors of higher degree.
References 1
- BarySorokerHokkenKozmaPoonen2025 · §1Definition of the random sign model and the all-degree conjecture.Source
Repeated roots
Theorem · Peled–Sen–Zeitouni
For fair independent signs, write . Then
The main term comes from repeated roots at and . The estimate concerns vanishing of the discriminant. A squarefree polynomial may still be reducible, and a nonzero discriminant may still be a square.
The proof separates roots by algebraic degree and distance from the unit circle, then uses anti-concentration and a local central limit calculation for the exceptional roots.
References 1
- PeledSenZeitouni2016 · Theorems 1.1 and 1.2; §1.1The displayed constant specializes Theorem 1.2 to mean-zero signs of variance one.Source
Reduction modulo two
Example
Modulo , all signs reduce to , so every degree-four Littlewood polynomial reduces to
The order of in is . Hence is irreducible over , and all degree-four Littlewood polynomials are irreducible over .
In general, . The same argument applies if is an odd prime for which is a primitive root. If , then , and the reduction gives no irreducibility certificate.
References 1
- LidlNiederreiter1997Cyclotomic factor degrees over finite fields.Source
Irreducibility in special degrees
Theorem · Bary-Soroker–Hokken–Kozma–Poonen
There is an absolute such that, for with ,
In particular, . The paper also treats degrees when is prime and generates .
For and , every coefficient below the leading one is even. Their residues modulo are independent and uniform in . With probability tending to one, a coefficient near the constant term has valuation exactly one. The 2-adic Newton polygon then gives a local irreducible factor of degree close to . If the polynomial factors over the rationals, a remaining factor must have small degree. The separate small-factor theorem excludes such a factor with probability tending to one.
References 1
- BarySorokerHokkenKozmaPoonen2025 · Theorem 1.2 and §2Special degrees and the Newton-polygon argument.Source
Square discriminants
Every Littlewood polynomial of even degree is separable: modulo , it becomes , which is squarefree. Its discriminant is never a square when .
In the reciprocal or skew-reciprocal subfamily, Hokken proves
Here the sampling is uniform within the chosen subfamily. This does not estimate the probability in the full Littlewood model, or prove irreducibility. The proof reduces the count to binomial sums and weighted Pythagorean triples.
References 1
- Hokken2026ReciprocalSquare · Theorem 1.1, Corollary 1.2 and §8Source
Example
Let . Modulo , , so every coefficient below the leading one is even. The constant term is not divisible by . Eisenstein at proves that , and hence , is irreducible over .
In the preceding probabilistic argument, the first coefficient of valuation one need not be the constant term.
References 1
- ConradIrredQEisenstein and translation preserve irreducibility.Source
The all-degree problem
Breuillard–Varjú prove high-probability irreducibility along all degrees under Riemann hypotheses for Dedekind zeta functions. The published unconditional result above gives a subsequence. Unconditional irreducibility along all degrees remains open in the cited sources; determining is a further problem.
Kogler’s 2026 preprint concerns monic polynomials with constant term . In that model, the internal coefficients remain random after reduction modulo . Reduction of sign coefficients modulo two is deterministic.
References 2
- BreuillardVarju2019Conditional growing-degree theorem.Source
- Kogler2026 · Theorem 1.1, v2The binary model is different.Source
Questions
Does irreducibility hold with probability tending to one along all degrees?
Scope. Fair independent ±1 coefficients over Q, with degree n tending to infinity.
The cited Littlewood paper formulates the all-degree conjecture and proves irreducibility with probability tending to one along a subsequence. The all-degree theorem of Breuillard–Varjú assumes Riemann hypotheses for Dedekind zeta functions.
References 1
- BarySorokerHokkenKozmaPoonen2025 · Equation (1.1), Theorems 1.1–1.2Source-scoped conjecture and proved subsequence.Source
Related topics
Connected diagrams
Browse all diagrams →Newton polygons and Galois groups
Translation yields a Newton polygon with a large irreducible local factor.
UsesIrreducibility over finite fields
The order of 2 modulo an odd prime determines the cyclotomic factor degrees.
Applies toRandom polynomials: models and methods
Independent signs give a two-point coefficient law.
Contrasts withFactor reversal for random binary polynomials
The binary model has random reduction modulo two.
Linked from 2 articles
References
- Irreducibility of Littlewood polynomials of special degrees
Bary-Soroker, Lior and Hokken, David and Kozma, Gady and Poonen, Bjorn. International Mathematics Research Notices, 2025(21), rnaf326, 2025.
Read the source - Double roots of random Littlewood polynomials
Peled, Ron and Sen, Arnab and Zeitouni, Ofer. Israel Journal of Mathematics, 213(1), 55–77, 2016.
Read the source - Finite Fields
Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.
Read the source - Counting (skew-)reciprocal Littlewood polynomials with square discriminant
Hokken, David. Israel Journal of Mathematics, 2026.
Read the source - Irreducibility tests in Q[T]
Conrad, Keith. Author-hosted expository note.
Read the source - Irreducibility of random polynomials of large degree
Breuillard, Emmanuel and Varjú, Péter P. Acta Mathematica, 223(2), 195–249, 2019.
Read the source - The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials
Kogler, Constantin. 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.