Galois groups of random integer polynomials and van der Waerden's Conjecture
Abstract
Of the (2H+1)n monic integer polynomials f(x)=xn+a1 xn-1+·s+an with \|a1|,…,|an|\≤ H, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.