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 Ln(x)=∑j=0nεjxjL_n(x)=\sum_{j=0}^{n}\varepsilon_jx^j, with εj∈{−1,1}\varepsilon_j\in\{-1,1\}. 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 11 and −1-1. If nn is even, Ln(1)L_n(1) and Ln(−1)L_n(-1) are both sums of an odd number of odd integers and therefore do not vanish. For n=2m−1n=2m-1, counting sign patterns gives

Pr⁡(Ln(1)=0)=(2mm)22m∼1πm.\Pr(L_n(1)=0)=\frac{\binom{2m}{m}}{2^{2m}}\sim\frac1{\sqrt{\pi m}}.

The event at −1-1 has the same probability. The two events are dependent. A reducibility estimate must also account for factors of higher degree.

References 1

Repeated roots

Theorem · Peled–Sen–Zeitouni

For fair independent signs, write Dn=Pr⁡(Ln has a repeated complex root)D_n=\Pr(L_n\text{ has a repeated complex root}). Then

Dn={83πn2+o(n−2),4∣n+1,o(n−2),4∤n+1.D_n=\begin{cases}\dfrac{8\sqrt3}{\pi n^2}+o(n^{-2}),&4\mid n+1,\\o(n^{-2}),&4\nmid n+1.\end{cases}

The main term comes from repeated roots at 11 and −1-1. 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 22, all signs reduce to 11, so every degree-four Littlewood polynomial reduces to

1+x+x2+x3+x4=Φ5(x).1+x+x^2+x^3+x^4=\Phi_5(x).

The order of 22 in (Z/5Z)×(\mathbb Z/5\mathbb Z)^\times is 44. Hence Φ5\Phi_5 is irreducible over F2\mathbb F_2, and all degree-four Littlewood polynomials are irreducible over Q\mathbb Q.

In general, L‾n=(xn+1−1)/(x−1)\overline L_n=(x^{n+1}-1)/(x-1). The same argument applies if n+1n+1 is an odd prime for which 22 is a primitive root. If n+1=2rn+1=2^r, then L‾n=(x+1)n\overline L_n=(x+1)^n, and the reduction gives no irreducibility certificate.

References 1

Irreducibility in special degrees

Theorem · Bary-Soroker–Hokken–Kozma–Poonen

There is an absolute c>0c>0 such that, for n=2r−1n=2^r-1 with r≥1r\ge1,

Pr⁡(Ln irreducible over Q)≥1−n−c.\Pr(L_n\text{ irreducible over }\mathbb Q)\ge1-n^{-c}.

In particular, lim sup⁡n→∞Pr⁡(Ln irreducible)=1\limsup_{n\to\infty}\Pr(L_n\text{ irreducible})=1. The paper also treats degrees n=pr−1n=p^r-1 when p≥7p\ge7 is prime and 22 generates (Z/p2Z)× (\mathbb Z/p^2\mathbb Z)^\times.

For n=2r−1n=2^r-1 and g(x)=Ln(x+1)g(x)=L_n(x+1), every coefficient below the leading one is even. Their residues modulo 44 are independent and uniform in {0,2}\{0,2\}. 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 nn. 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

Square discriminants

Every Littlewood polynomial of even degree is separable: modulo 22, it becomes (xn+1−1)/(x−1)(x^{n+1}-1)/(x-1), which is squarefree. Its discriminant is never a square when n≡2,4(mod8)n\equiv2,4\pmod8.

In the reciprocal or skew-reciprocal subfamily, Hokken proves

Pr⁡(disc⁡(f) is a square)≍log⁡nn(n≡0,6(mod8)).\Pr(\operatorname{disc}(f)\text{ is a square})\asymp\frac{\log n}{\sqrt n}\qquad(n\equiv0,6\pmod8).

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

Example

Let L(x)=1+x+x2+x3+x4+x5+x6−x7L(x)=1+x+x^2+x^3+x^4+x^5+x^6-x^7. Modulo 22, L(x+1)=x7L(x+1)=x^7, so every coefficient below the leading one is even. The constant term L(1)=6L(1)=6 is not divisible by 44. Eisenstein at 22 proves that L(x+1)L(x+1), and hence L(x)L(x), is irreducible over Q\mathbb Q.

In the preceding probabilistic argument, the first coefficient of valuation one need not be the constant term.

References 1

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 SnS_n is a further problem.

Kogler’s 2026 preprint concerns monic 0/10/1 polynomials with constant term 11. In that model, the internal coefficients remain random after reduction modulo 22. Reduction of sign coefficients modulo two is deterministic.

References 2

Questions

OpenCounting and probability

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
Discuss this question →

Related topics

References

  1. 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
  2. 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
  3. Finite Fields

    Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.

    Read the source
  4. Counting (skew-)reciprocal Littlewood polynomials with square discriminant

    Hokken, David. Israel Journal of Mathematics, 2026.

    Read the source
  5. Irreducibility tests in Q[T]

    Conrad, Keith. Author-hosted expository note.

    Read the source
  6. Irreducibility of random polynomials of large degree

    Breuillard, Emmanuel and Varjú, Péter P. Acta Mathematica, 223(2), 195–249, 2019.

    Read the source
  7. The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials

    Kogler, Constantin. 2026.

    Read the source