Counting Polynomials via Galois Actions on Root Subsets
Or Ben-Porath

TL;DR
This paper develops new bounds on the number of integer polynomials with bounded height that have a Galois group acting on roots as a specific permutation group, advancing understanding of polynomial Galois groups.
Contribution
It introduces novel upper bounds for counting polynomials with prescribed Galois groups, covering various group actions including transitive, k-homogeneous, and k-transitive groups.
Findings
Derived bounds for transitive subgroups of wreath products.
Established bounds for k-homogeneous subgroups.
Analyzed groups in their regular permutation representations.
Abstract
This paper studies the number of monic integer polynomials of height at most whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group . New upper bounds are obtained for several families of groups: transitive subgroups of the wreath product in the primitive action; -homogeneous subgroups of in the action on -subsets of ; -transitive subgroups of in the action on -tuples of distinct elements of . Almost all finite groups in their regular permutation representation are also treated.
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Finite Group Theory Research · Algebraic Geometry and Number Theory
