Overview
- How many monic polynomials of bounded height have group different from Sₙ?
- Are irreducible exceptions fewer than reducible polynomials?
- Why does the reciprocal exceptional count contain a logarithm?
Monic polynomials
Fix and consider the monic polynomials
There are choices. Let count the polynomials with repeated roots, together with the separable polynomials whose Galois group on the roots is not . Thus reducible polynomials are included. Throughout this section, the degree is fixed as the height grows.
Theorem · Bhargava
For fixed ,
The choices with all have the factor and give a lower bound of the same order. The exceptional proportion therefore has order .
References 1
- Bhargava2025 · Theorem 1Sharp upper bound in the fixed-degree box model; the safe stated range here is n≥3.Source
Quadratics
Example
Consider for integers and . For sufficiently large , the coefficient bounds and hold. Distinct unordered pairs give distinct polynomials. Summing over the available 's for each gives reducible quadratics.
Thus the bound for all exceptional polynomials fails at . A count restricted to irreducible polynomials with exceptional transitive group excludes these examples.
Irreducible exceptions
Let count only the irreducible polynomials in the monic box whose Galois group is not . The strong van der Waerden conjecture asks whether .
Preprint result · Anderson et al. (2026)
The degree is fixed as . Version 2 proves the required twisted Möbius-correlation estimate in this range. Its stronger correlation conjecture would extend the conclusion to . The argument uses a square sieve, differencing and finite-field estimates.
References 1
- AndersonEtAl2026StrongVdW · Conjecture 1.1; Theorems 1.2, 1.4–1.5; Conjecture 1.6Version 2; I_n here is the paper’s E_n, to distinguish it from the atlas’s count including reducible polynomials.Source
Nonmonic polynomials
Let count degree- polynomials in that are reducible over and whose coefficients have absolute value at most . The leading coefficient may be any nonzero integer in the given range. Kuba proves
The total count is , so the reducible proportion has order for . The nonmonic count has one additional power of relative to the monic count.
The proof counts factorizations using height inequalities and lattice-point estimates. For , all but reducible polynomials have an irreducible factor of degree and hence a linear cofactor.
Sieves and number fields
At good primes, a Galois group restricts the possible factorization types. Gallagher’s large sieve bounds the number of coefficient vectors whose reductions satisfy these restrictions at many primes.
Bhargava’s sharper bounds use the structure of the exceptional permutation groups and the discriminants of the number fields generated by roots, together with Fourier and geometric-sieve estimates. The count is over coefficient vectors. Many polynomials can define the same number field, so a count by field discriminant answers a different question.
References 2
- Gallagher1973The large sieve in probabilistic Galois theory.Source
- Bhargava2025 · Introduction and Theorem 2Group-sensitive bounds and the link with counting number fields.Source
Counting fields by polynomial height
For a degree- number field , define as the least coefficient height of an integral degree- polynomial defining , with no monicity condition. Arango-Piñeros et al. state the following preprint asymptotic:
where fields are counted up to isomorphism and . For , the asymptotic is . The proof controls when two small defining polynomials give the same field, using the action of rational linear fractional transformations.
Counting by field discriminant is a separate problem; Chow–Dietmann give bounds for prescribed even permutation groups in that setting.
References 2
- ArangoPinerosEtAl2026SmallestPolynomial · §1, Theorems 1.1–1.2Source
- ChowDietmann2026NumberFields · §1.1, Theorem 1.8 and Remark 1.9Source
Prescribed permutation actions
Write for the set of monic separable integer polynomials of degree , height at most , and root action isomorphic to .
Reported preprint result · Ben-Porath (2026)
Let . If is -transitive and denotes the ordered -tuples of distinct elements, then for fixed and every ,
For on ordered pairs, the degree is and the bound is . The natural action has degree five.
The coefficients of generate the field fixed by the setwise stabilizer of the root subset . The proof chooses families of subsets to recover the splitting field while controlling the heights. The paper also treats subset actions, primitive wreath-product actions, and regular actions.
References 1
- BenPorath2026RootSubsets · Theorem 1.3; Lemma 3.1 and Proposition 3.3The degree is the size of the specified permutation set, not the natural permutation degree m.Source
Reciprocal polynomials
A monic reciprocal polynomial of degree has free coefficients. If the polynomial is separable, its Galois group lies in .
Theorem · Anderson–Bertelli–O’Dorney
For each fixed , among separable monic reciprocal polynomials with coefficients bounded by , the number whose group is a proper subgroup of is
For nonmonic reciprocal polynomials, the corresponding count is for every .
The logarithmic factor arises from a square-value condition. Polynomials whose Galois group lies in the index-two subgroup of even permutations give the main exceptional contribution. The corrected source leaves the monic quartic case open.
References 1
- AndersonBertelliODorney2026 · Theorems 1.1 and 1.3; Remark 1.4, corrected v2Degree ranges, exceptional orders and the quartic boundary.Source
Example
For a monic reciprocal quadratic , the discriminant is . If this equals an integer square , then . Since the two factors have the same parity, the integer solutions have and . Every separable polynomial in this family has group , so the exceptional count in monic degree two is zero.
In the fixed-degree ranges of the ordinary and reciprocal counting theorems, the maximal group occurs with density one.
Questions
What is the order of the exceptional count for monic reciprocal quartics?
Scope. Separable monic reciprocal quartics over Z, with coefficient height H tending to infinity.
The corrected source proves the monic bound for half-degree and leaves open. The nonmonic bound includes quartics.
References 1
- AndersonBertelliODorney2026 · Remark 1.4 and Remark 1.6, v2Explicit low-degree exception.Source
Are irreducible exceptions negligible in every fixed degree?
Scope. Monic integer polynomials of fixed degree 5≤n≤39 and coefficient height H→∞.
Does hold throughout this range? Here excludes reducible polynomials. The cited preprint proves the claim for ; the cubic and quartic cases were known earlier. Its twisted Chowla conjecture would cover , leaving smaller degrees to other arguments.
References 2
- AndersonEtAl2026StrongVdW · Conjecture 1.1; Theorems 1.2 and 1.4; Conjecture 1.6; §1.3Source
- ChowDietmann2020 · Introduction and the cubic and quartic counting resultsSource
Related topics
Specialization and Hilbert irreducibility
Height counts quantify exceptional specializations.
UsesFrobenius and factorization modulo primes
Factorization modulo primes gives the local conditions for the sieve.
UsesReciprocal polynomials
The inverse pairs determine the ambient permutation group.
Contrasts withRandom polynomials: models and methods
The height tends to infinity at fixed degree.
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 - The strong form of Van der Waerden’s conjecture via twisted Chowla
Anderson, Theresa C. and Chow, Sam and Dietmann, Rainer and Hokken, David and Koymans, Peter and Lemke Oliver, Robert J. and Sawin, Will and Shusterman, Mark. arXiv, 2026.
Read the source - On the distribution of reducible polynomials
Kuba, Gerald. Mathematica Slovaca, 59(3), 349–356, 2009.
Read the source - The large sieve and probabilistic Galois theory
Gallagher, P. X. Analytic Number Theory, American Mathematical Society, Proceedings of Symposia in Pure Mathematics, 24, 91–101, 1973.
Read the source - Counting number fields of fixed degree by their smallest defining polynomial
Arango-Piñeros, Santiago and Gundlach, Fabian and Lemke Oliver, Robert J. and McGown, Kevin J. and Sawin, Will and Serrano López, Allechar and Shankar, Arul and Varma, Ila. arXiv, 2026.
Read the source - Enumerative Galois theory for number fields
Chow, Sam and Dietmann, Rainer. Mathematika, 2026.
Read the source - Counting Polynomials via Galois Actions on Root Subsets
Ben-Porath, Or. 2026.
Read the source - Galois groups of reciprocal polynomials and the van der Waerden-Bhargava theorem
Anderson, Theresa C. and Bertelli, Adam and O'Dorney, Evan M. Algebra & Number Theory, 20(3), 603–628, 2026.
Read the source - Enumerative Galois theory for cubics and quartics
Chow, Sam and Dietmann, Rainer. Advances in Mathematics, 372, Article 107282, 2020.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.