Galois groups of random integer polynomials and van der Waerden's Conjecture

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\mathrm{max}\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such polynomials, as may be obtained by setting $a_n=0$. In 1936, van der Waerden conjectured that $O(H^{n-1})$ should in fact also be the correct upper bound for the count of such polynomials. The conjecture has been known previously for degrees $n\leq 4$, due to work of van der Waerden and Chow and Dietmann. The purpose of this paper is to prove van der Waerden's Conjecture for all degrees $n$.

Authors

Institutions

Publication Details

Journal
Annals of Mathematics
Published
2025-03-01
DOI
https://doi.org/10.4007/annals.2025.201.2.1
Citations
5
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
12.40
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Galois groups of random integer polynomials and van der Waerden's Conjecture

Manjul Bhargava
5 citations
Annals of Mathematics
Coding theory and cryptography
12.40
article

Galois groups of random integer polynomials and van der Waerden's Conjecture

Manjul Bhargava
article en
5 citations

Abstract

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\mathrm{max}\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such polynomials, as may be obtained by setting $a_n=0$. In 1936, van der Waerden conjectured that $O(H^{n-1})$ should in fact also be the correct upper bound for the count of such polynomials. The conjecture has been known previously for degrees $n\leq 4$, due to work of van der Waerden and Chow and Dietmann. The purpose of this paper is to prove van der Waerden's Conjecture for all degrees $n$.

Annals of MathematicsVol. 201(2)
Princeton University (US)
Openalex Percentile: Top 2%
Coding theory and cryptography
12.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.