Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Upper Bounds for the Number of Number Fields with Alternating Galois Group (1107.1182v1)

Published 6 Jul 2011 in math.NT

Abstract: We study the number $N(n, A_n, X)$ of number fields of degree $n$ whose Galois closure has Galois group $A_n$ and whose discriminant is bounded by $X$. By a conjecture of Malle, we expect that $N(n, A_n, X) \sim C_n X{1/2} (\log X){b_n}$, for constants $b_n$ and $C_n$. For $5 < n < 84394$, the best known upper bound is $N(n, A_n, X) \ll X{\frac{n + 2}{4}}$; this bound follows from Schmidt's Theorem, which implies there are $\ll X{\frac{n + 2}{4}}$ number fields of degree $n$. (For $n > 84393$, there are better bounds due to Ellenberg and Venkatesh.) We show, using the important work of Pila on counting integral points on curves, that $N(n, A_n, X) \ll X{\frac{n2 - 2}{4(n - 1)}+\epsilon}$, thereby improving the best previous exponent by approximately 1/4 for $5 < n < 84394$.

Summary

We haven't generated a summary for this paper yet.