TY - JOUR
T1 - A proof of van der Waerden’s Conjecture on random Galois groups of polynomials
AU - Bhargava, Manjul
N1 - Publisher Copyright:
© 2023, International Press, Inc.. All rights reserved.
PY - 2023
Y1 - 2023
N2 - Of the (2H +1)n monic integer polynomials f(x) = xn+a1xn−1+···+an with max{|a1|,…,|an|} ≤ H,howmanyhave associated Galois group that is not the full symmetric group Sn? There are clearly ≫ Hn−1 such polynomials, as may be obtained by setting an = 0. In 1936, van der Waerden conjectured that O(Hn−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 ≤ 4, due to work of van der Waerden and Chow and Dietmann. In this expository article, we outline a proof of van der Waerden’s Conjecture for all degrees n.∗.
AB - Of the (2H +1)n monic integer polynomials f(x) = xn+a1xn−1+···+an with max{|a1|,…,|an|} ≤ H,howmanyhave associated Galois group that is not the full symmetric group Sn? There are clearly ≫ Hn−1 such polynomials, as may be obtained by setting an = 0. In 1936, van der Waerden conjectured that O(Hn−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 ≤ 4, due to work of van der Waerden and Chow and Dietmann. In this expository article, we outline a proof of van der Waerden’s Conjecture for all degrees n.∗.
UR - http://www.scopus.com/inward/record.url?scp=85153598584&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85153598584&partnerID=8YFLogxK
U2 - 10.4310/PAMQ.2023.v19.n1.a3
DO - 10.4310/PAMQ.2023.v19.n1.a3
M3 - Article
AN - SCOPUS:85153598584
SN - 1558-8599
VL - 19
SP - 45
EP - 60
JO - Pure and Applied Mathematics Quarterly
JF - Pure and Applied Mathematics Quarterly
IS - 1
ER -