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 on polynomials with small Galois group (1910.02122v1)

Published 4 Oct 2019 in math.NT

Abstract: When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group isomorphic to $S_n$. In particular, amongst such polynomials whose coefficients are bounded by $B$ in absolute value, asymptotically $(1+o(1))(2B+1)n$ are irreducible and have Galois group $S_n$. When $G$ is a proper transitive subgroup of $S_n$, however, the asymptotic count of polynomials with Galois group $G$ has been determined only in very few cases. Here, we show that if there are strong upper bounds on the number of degree $n$ fields with Galois group $G$, then there are also strong bounds on the number of polynomials with Galois group $G$. For example, for any prime $p$, we show that there are at most $O(B{3 - \frac{2}{p}} (\log B){p - 1})$ polynomials with Galois group $C_p$ and coefficients bounded by $B$.

Summary

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