
TL;DR
This paper provides an upper bound on the number of monic integer polynomials with a given Galois group, showing that polynomials with smaller Galois groups are relatively rare among all polynomials of bounded height.
Contribution
It establishes a quantitative bound on the count of polynomials with a specified Galois group, linking group index to polynomial enumeration.
Findings
Bound of O_{n, ε}(H^{n-1+δ_G+ε}) for polynomials with Galois group G
Fewer polynomials have small Galois groups compared to the total
Quantitative relationship between Galois group size and polynomial count
Abstract
Let be a subgroup of the symmetric group , and let where is the index of in . Then there are at most monic integer polynomials of degree having Galois group and height not exceeding , so there are only `few' polynomials having `small' Galois group.
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.
