Overview
- Which coefficient laws give irreducibility as degree grows?
- When is Aₙ contained in the group, and when is the group Sₙ?
- How do modular factorization and discriminant estimates enter the proofs?
Probability models
In each row the displayed limit is taken with the stated law or degree fixed. A conclusion for one row need not hold in another.
| Model and independent data | Limit and conditioning | Conclusion and source |
|---|---|---|
| Monic ; all coordinates uniform in . | Fixed ; . No conditioning. | The number with group different from , including repeated-root cases, is . Bhargava, Theorem 1. |
| Monic polynomial; nonleading coefficients independent with a fixed finitely supported nonconstant law . | ; condition on . | For some , no nonconstant factor of degree less than , with probability . Bary-Soroker–Koukoulopoulos–Kozma, Theorem 2. |
| Same monic model; uniform on a fixed interval of at least consecutive integers. | ; condition on . | Irreducible and group or , with probability . Same source, Theorems 1(a) and 6. |
| Monic polynomial; nonleading coefficients independent uniform in . | , . No conditioning. | Group with probability . Bary-Soroker–Goldgraber, Theorem 1.1. No fixed-width conclusion follows. |
| Littlewood polynomial; all coefficients independent fair signs. | , with , or prime for which generates . No conditioning. | Irreducible with probability at least . Bary-Soroker–Hokken–Kozma–Poonen, Theorem 1.2. |
| Binary polynomial; leading and constant coefficients equal ; internal coefficients independent uniform in . | ; no further conditioning. | A recent preprint claims reducibility probability . Kogler, Theorem 1.1, v2. |
| Monic reciprocal polynomial of degree ; free coefficients independent uniform on a fixed interval of at least integers; reflected coefficients are equal. | ; no conditioning. | Preprint: irreducible, with group among and two specified index-two subgroups, with probability . Hokken–Koukoulopoulos, Theorem A, v2. |
None of the displayed coefficient results assumes a Riemann hypothesis. For arbitrary fixed laws, however, the small-factor conclusion does not exclude two factors of comparable degree. If , the event has fixed positive probability, so irreducibility cannot tend to one without addressing it. Fixing the constant coefficient to defines a different model and must be justified separately.
Matrix models, multiplicative coefficients, and the function-field model have their own independence and arithmetic hypotheses. In the repeated-root theorem below, every coefficient is randomized, including the leading one.
References 6
- Bhargava2025 · Theorem 1Source
- BarySorokerKoukoulopoulosKozma2023 · Theorems 1, 2 and 6Source
- BarySorokerGoldgraber2025 · Theorem 1.1Source
- BarySorokerHokkenKozmaPoonen2025 · Theorem 1.2Source
- Kogler2026 · Theorem 1.1, arXiv:2609.26771v2Preprint claim for the fixed-endpoint binary model.Source
- HokkenKoukoulopoulos2025 · Theorem A and equation (14.3), arXiv:2510.18857v2Preprint; alternatives are defined in the linked article.Source
Small factors and interval laws
Theorem · Bary-Soroker–Koukoulopoulos–Kozma
For every fixed, finitely supported, nonconstant law , there is such that, conditional on , the probability of a nonconstant factor of degree less than tends to zero.
If is uniform on a fixed interval of at least consecutive integers, then, under the same conditioning,
The small-factor estimate leaves open the possibility of two factors of comparable degree, for example near . In the interval case, the group is or with probability tending to one.
References 1
- BarySorokerKoukoulopoulosKozma2023 · Theorems 1, 2 and 6Small-factor exclusion; interval-law irreducibility; Galois-group conclusions.Source
Cyclotomic factors and error bounds
For coefficients uniform on a fixed interval of integers, Bazin’s Theorem 1.1.2 gives
For each fixed , if the interval is sufficiently long in terms of , Theorem 1.1.4 gives
where consists of zero and the roots of unity of degree less than over .
Repeated roots
Consider , with all coefficients, including the leading coefficient, independent and of a fixed bounded integer law with . Feldheim–Sen prove
If , this probability is . If , then has probability and forces a repeated root at zero.
The proof separates possible roots by algebraic degree and size and uses anti-concentration for integer evaluations. Applying the theorem to a monic or conditioned ensemble requires a separate justification.
References 1
- FeldheimSen2017 · Theorem 1.1 and §1.1The full iid model and the largest-atom condition are essential to the stated theorem.Source
Root separation and discriminant size
For independent, identically distributed mean-zero sub-Gaussian coefficients with no atom at zero, Michelen–Yakir prove that the minimum distance between roots, indexed with multiplicity, has scale and a nondegenerate limiting law. Their Corollary 1.2 gives a vanishing probability of repeated roots under these hypotheses, without the largest-atom restriction for bounded integer laws. The earlier theorem for Littlewood polynomials gives a sharper quantitative bound in that model.
In a separate preprint, for under the additional normalization , they report
The proof uses a reciprocal form of the discriminant identity, Mahler measure, and root statistics. Distinguishing from requires an additional arithmetic argument about the square class. The no-zero-atom hypothesis removes the repeated-root obstruction at zero.
References 2
- MichelenYakir2026RootSeparation · Theorem 1.1 and Corollary 1.2The hypotheses here retain mean zero, sub-Gaussian tails and no atom at zero.Source
- MichelenYakir2025Discriminant · Theorem 1; §1.3; equation (10)The displayed convergence is a preprint theorem; the no-zero-atom and variance assumptions are explicit in the full statement.Source
Fourier estimates and Frobenius
For a nonzero candidate divisor , divisibility is the event that a random sum vanishes in . Independence gives a product formula for its Fourier transform. Decay of the product controls deviation from uniformity, with exceptions determined by the characters and the structure of the quotient algebra. Possible rational factor degrees must occur among the subset sums of the modular factor degrees at each prime. Combinatorial estimates bound the probability of a common subset sum.
At primes of squarefree reduction, the modular factors give Frobenius cycle types. Probabilistic permutation-group estimates exclude most proper transitive groups. A second method averages root counts over primes and uses effective prime-ideal estimates to study global Galois orbits. Breuillard–Varjú use Riemann hypotheses for Dedekind zeta functions in this step.
References 2
- BarySorokerKoukoulopoulosKozma2023 · §2Fourier estimates, factor-degree sieving and permutation groups.Source
- BreuillardVarju2019Conditional prime-ideal and random-walk method.Source
The square-discriminant probability
Reported preprint result · Blachar–Breuillard–Kozma, v1
Let , where are independent with a fixed finitely supported integer law . If
the preprint reports . This is the constant-term-one case of its stated Theorem 1.1.
Corollary 1.2 states that when all are independent and uniform on a fixed interval of integers, is irreducible with group , conditional on , with probability .
Remark on the scope of Theorem 1.1
The unqualified square-discriminant bound in v1 fails for some permitted constant-term laws. For , if are independent with law and , then
On this event, and the discriminant is the square zero. The obstruction occurs even for a uniform interval with containing zero. The repeated-root estimate invoked at the start of Section 8 cannot hold in that setting. Fixing a nonzero constant term removes this particular obstruction. The restricted statements above remain reported preprint claims; this observation does not verify the rest of their proof.
The argument studies double roots modulo primes and their lifts modulo prime squares to bound discriminant valuations. Once -containment is known, a nonsquare discriminant forces . For a uniform law on values, . The fair-sign law has , below the required threshold.
References 1
- BlacharBreuillardKozma2026 · Theorem 1.1, Corollary 1.2, and opening of §8, v1Reported preprint statements; the atlas excludes the zero-constant obstruction and records the scope issue in the original square-discriminant assertion.Source
Example
For coefficients uniform on , the 35-point theorem gives irreducibility and -containment with probability tending to one conditional on . Without conditioning, is a factor with probability .
For coefficients uniform on , the constant term is nonzero. The 35-consecutive-integer theorem and the entropy bound both require larger supports. For coefficients uniform on with , Bary-Soroker–Goldgraber give full with probability tending to one. In this last model the probability of a zero constant term tends to zero.
An experiment should record the coefficient law, degree, sample size and group-certification method. It estimates a probability for that model; it does not prove the limiting theorem.
References 1
- BarySorokerGoldgraber2025The widening-interval theorem.Source
Multiplicative coefficients
Choose independent fair signs for primes , put , and extend completely multiplicatively by . Define
Assuming RH for the Dedekind zeta functions of all number fields, Varjú–Xu prove that for every ,
The theorem also covers the variant with at nonsquarefree integers. In both models one removes the factor ; in the second, the degree of the original polynomial may be less than . For example, the coefficients satisfy . The proof combines finite-field root averages with arithmetic equidistribution. The corresponding deterministic questions for Fekete polynomials are separate.
References 1
- VarjuXu2026 · Theorem 1.1; §1.1; Problem 1.2Both multiplicative models are specified in the introduction; the conditional conclusion concerns P_d/x.Source
Polynomials over a function field
Fix a prime power and set
Entin–Popov take the splitting field over . For fixed and , the probability of irreducibility, separability, and Galois group tends to one. For fixed and ,
Entin subsequently removed the Chowla hypothesis for odd : with fixed , the conditional probability tends to one. His method does not treat characteristic two. The base field here is . Over the finite field itself, every irreducible degree- polynomial has cyclic Galois group of order .
References 2
- EntinPopov2024 · Theorems 1.1, 1.2, 1.4 and 1.6; Conjecture 1.5Entin–Popov’s original full symmetric conclusion was conditional and assumed odd q; Entin’s later theorem removes that condition on Chowla.Source
- Entin2025RationalFunction · Corollary 1.1 and Remark 1.4Unconditional full symmetric group in odd characteristic; the characteristic-two case lies outside the theorem.Source
Questions
Can one prove full symmetric groups for small fixed coefficient laws?
Scope. Independent bounded coefficients over Q, with the zero-constant obstruction excluded.
The entropy hypothesis of the cited preprint excludes small-support laws, including fair signs. For these laws, the stated estimate gives no bound for the square-discriminant probability.
References 1
- BlacharBreuillardKozma2026 · Introduction after Theorem 1.1The authors discuss the entropy assumption as a limitation of their method.Source
How short can the prime interval be?
Scope. A prime P sampled uniformly from (d,H(d)], where this interval contains at least one prime.
Set
Varjú–Xu ask for the probability that this polynomial is irreducible after its linear factors are removed. Assuming RH for the Dedekind zeta functions of all number fields, they prove
when ; here counts primes at most . The behavior in shorter intervals is the open problem. The endpoint gives the classical Fekete family, whose additional linear factors must also be removed.
References 1
- VarjuXu2026 · Problem 1.2 and Corollary 1.3The random-prime truncated model is different from the all-prime classical Fekete conjecture.Source
Does the full symmetric conclusion hold in characteristic two?
Scope. Fixed q a power of two and d≥1; independent uniform coefficients in F_q[t] of degree at most d; polynomial degree n→∞.
Does ? Entin proves this for odd . Remark 1.4 explains why the discriminant argument does not extend to characteristic two.
References 2
- Entin2025RationalFunction · Corollary 1.1 and Remark 1.4Source
- EntinPopov2024 · Remark 1.7Explicitly expects the full symmetric conclusion without the odd-characteristic restriction.Source
Related topics
Connected diagrams
Browse all diagrams →Littlewood polynomials
The fair-sign law has two atoms.
Contrasts withFactor reversal for random binary polynomials
Binary coefficients admit a reciprocal-product identity.
Contrasts withHeight bounds for exceptional Galois groups
The degree is fixed and the coefficient height tends to infinity.
UsesDiscriminants, parity, and ramification
A nonsquare discriminant distinguishes S_n from A_n once containment is proved.
Linked from 7 articles
References
- Galois groups of random integer polynomials and van der Waerden’s Conjecture
Bhargava, Manjul. Annals of Mathematics, 201(2), 339–377, 2025.
Read the source - Irreducibility of random polynomials: general measures
Bary-Soroker, Lior and Koukoulopoulos, Dimitris and Kozma, Gady. Inventiones Mathematicae, 233(3), 1041–1120, 2023.
Read the source - Full Galois groups of polynomials with slowly growing coefficients
Bary-Soroker, Lior and Goldgraber, Noam. Bulletin of the London Mathematical Society, 57(3), 941–955, 2025.
Read the source - 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 - The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials
Kogler, Constantin. 2026.
Read the source - Irreducibility and Galois groups of random reciprocal polynomials of large degree
Hokken, David and Koukoulopoulos, Dimitris. 2025.
Read the source - Irreducibility of random polynomials of ℤ[X]
Bazin, Pierre-Alexandre. International Mathematics Research Notices, 2025(11), rnaf136, 2025.
Read the source - Double roots of random polynomials with integer coefficients
Feldheim, Ohad N. and Sen, Arnab. Electronic Journal of Probability, 22, Article 10, 1–23, 2017.
Read the source - Limit law for root separation in random polynomials
Michelen, Marcus and Yakir, Oren. Advances in Mathematics, 496, Article 110990, 2026.
Read the source - Law of large numbers for the discriminant of random polynomials
Michelen, Marcus and Yakir, Oren. 2025.
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 - Galois groups of random polynomials of large degree
Blachar, Guy and Breuillard, Emmanuel and Kozma, Gady. 2026.
Read the source - A random polynomial with multiplicative coefficients is almost surely irreducible
Varjú, Péter P. and Xu, Max Wenqiang. International Mathematics Research Notices, 2026(16), rnag178, 2026.
Read the source - Probabilistic Galois theory in function fields
Entin, Alexei and Popov, Alexander. Finite Fields and Their Applications, 98, Article 102466, 2024.
Read the source - Galois groups of random polynomials over the rational function field
Entin, Alexei. Journal of the London Mathematical Society, 111(1), Article e70061, 2025.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.