HackerPapers

arXiv:2111.06507math.NT

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

Manjul Bhargava

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\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$.

arXiv comments
34 pages; a number of clarifications and details have been added in this version; to appear in Annals of Math
Journal reference
DOI
Subjects
math.NTNumber Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Apr 2022 to Apr 2022.

Comments linking this paper, per year.

Discussed in comments1 thread

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.