Asymptotic Bounds for the Size of Hom$(A,{\rm GL}_n(q))$
Michael Bate, Alec Gullon

TL;DR
This paper investigates the asymptotic behavior of the number of homomorphisms from a fixed finite group to general linear groups over finite fields, providing bounds, formulas, and an algorithm for key constants.
Contribution
It establishes asymptotic bounds for the size of Hom$(A,GL_n(q))$, including degree and leading coefficient formulas, and introduces an algorithm to compute related constants.
Findings
Polynomial size of Hom$(A,GL_n(q))$ in $q$
Degree of polynomial depends on $n$ and $a$
Algorithm for computing constants $ epsilon_r$ and $m_r$
Abstract
Fix an arbitrary finite group of order , and let denote the set of homomorphisms from to the finite general linear group . The size of is a polynomial in . In this note it is shown that generically this polynomial has degree and leading coefficient , where and are constants depending only on . We also present an algorithm for explicitly determining these constants.
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 Algebra and Geometry · Finite Group Theory Research · Advanced Combinatorial Mathematics
