Equidistribution of high traces of random matrices over finite fields and cancellation in character sums of high conductor
Ofir Gorodetsky, Valeriya Kovaleva

TL;DR
This paper proves that high traces of random matrices over finite fields become uniformly distributed as matrix size grows, extending previous results and connecting the problem to cancellation in character sums over function fields.
Contribution
It establishes sharp bounds for the equidistribution of traces and their linear combinations, extending the known range from linear to quadratic in the matrix size, and links the problem to character sum cancellation.
Findings
High traces equidistribute as matrix size increases, for log k=o(n^2)
Linear combinations of traces also equidistribute for log k=o(n)
Connection established between trace distribution and cancellation in short character sums
Abstract
Let be a random matrix distributed according to uniform probability measure on the finite general linear group . We show that equidistributes on as as long as and that this range is sharp. We also show that nontrivial linear combinations of equidistribute as long as and this range is sharp as well. Previously equidistribution of either a single trace or a linear combination of traces was only known for , where depends on , due to work of the first author and Rodgers. We reduce the problem to exhibiting cancellation in certain short character sums in function fields. For the equidistribution of we end up showing that certain explicit character sums modulo exhibit cancellation when…
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
TopicsFinite Group Theory Research · Coding theory and cryptography · Advanced Algebra and Geometry
