A proof of van der Waerden's Conjecture on random Galois groups of polynomials

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. In this expository article, we outline a proof of van der Waerden's Conjecture for all degrees n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…