Galois groups of random integer matrices
Theresa C. Anderson, Evan M. O'Dorney

TL;DR
This paper investigates the frequency of integer matrices with bounded entries whose characteristic polynomial's Galois group is not the full symmetric group, providing bounds and conjectures on their count.
Contribution
It introduces new bounds on the number of such matrices and applies advanced sieve and Fourier analysis techniques to improve these bounds for specific classes.
Findings
Established an upper bound on the count of matrices with non-full symmetric Galois groups.
Conjectured the sharpness of the known lower bound for the count.
Applied Fourier analysis and the geometric sieve to refine bounds for certain matrix classes.
Abstract
We study the number be the number of integer matrices with entries bounded in absolute value by such that the Galois group of characteristic polynomial of is not the full symmetric group . One knows , which we conjecture is sharp. We first use the large sieve to get . Using Fourier analysis and the geometric sieve, as in Bhargava's proof of van der Waerden's conjecture, we improve this bound for some classes of .
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.
