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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Of the (2H + 1)n monic integer polynomials (Formula presented) with (Formula presented), how many have 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. The purpose of this paper is to prove van der Waerden’s Conjecture for all degrees n.

Original languageEnglish (US)
Pages (from-to)339-377
Number of pages39
JournalAnnals of Mathematics
Volume201
Issue number2
DOIs
StatePublished - 2025

All Science Journal Classification (ASJC) codes

  • Mathematics (miscellaneous)

Keywords

  • Galois group
  • integer polynomial
  • permutation group
  • primitive group
  • random polynomial

Fingerprint

Dive into the research topics of 'Galois groups of random integer polynomials and van der Waerden’s Conjecture'. Together they form a unique fingerprint.

Cite this