Upper bounds on polynomials with small Galois group
Robert J. Lemke Oliver, Frank Thorne

TL;DR
This paper establishes upper bounds on the number of polynomials with small Galois groups, linking field count bounds to polynomial count bounds, and providing explicit estimates for cyclic groups of prime order.
Contribution
It connects bounds on the number of degree n fields with Galois group G to bounds on polynomials with the same Galois group, offering explicit estimates for cyclic groups.
Findings
Bound on polynomials with Galois group C_p: O(B^{3 - 2/p} (log B)^{p - 1})
Link between field counts and polynomial counts for small Galois groups
Extension of asymptotic results to proper transitive subgroups of S_n
Abstract
When monic integral polynomials of degree 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 . In particular, amongst such polynomials whose coefficients are bounded by in absolute value, asymptotically are irreducible and have Galois group . When is a proper transitive subgroup of , however, the asymptotic count of polynomials with Galois group has been determined only in very few cases. Here, we show that if there are strong upper bounds on the number of degree fields with Galois group , then there are also strong bounds on the number of polynomials with Galois group . For example, for any prime , we show that there are at most …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
