Hostname: page-component-89b8bd64d-shngb Total loading time: 0 Render date: 2026-05-09T01:39:06.458Z Has data issue: false hasContentIssue false

Squarefree values of polynomial discriminants II

Published online by Cambridge University Press:  13 May 2025

Manjul Bhargava
Affiliation:
Department of Mathematics, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544-1000, USA; E-mail: bhargava@math.princeton.edu
Arul Shankar*
Affiliation:
Department of Mathematics, Univerity of Toronto, 40 St. George Street, Toronto, ON M5S 2E4, Canada;
Xiaoheng Wang
Affiliation:
Department of Pure Mathematics, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada; E-mail: x46wang@uwaterloo.ca
*
E-mail: ashankar@math.toronto.edu (corresponding author)

Abstract

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out maximal orders in number fields. The latter proves, in particular, an ‘arithmetic Bertini theorem’ conjectured by Poonen for ${\mathbb {P}}^1_{\mathbb {Z}}$.

Our methods also allow us to prove that there are $\gg X^{1/2+1/(n-1)}$ number fields of degree n having associated Galois group $S_n$ and absolute discriminant less than X, improving the best previously known lower bound of $\gg X^{1/2+1/n}$.

Finally, our methods correct an error in and thus resurrect earlier (retracted) results of Nakagawa on lower bounds for the number of totally unramified $A_n$-extensions of quadratic number fields of bounded discriminant.

Information

Type
Number Theory
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press