Skip to Main Content

Transactions of the American Mathematical Society

Published by the American Mathematical Society since 1900, Transactions of the American Mathematical Society is devoted to longer research articles in all areas of pure and applied mathematics.

ISSN 1088-6850 (online) ISSN 0002-9947 (print)

The 2020 MCQ for Transactions of the American Mathematical Society is 1.48.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Traces of powers of matrices over finite fields
HTML articles powered by AMS MathViewer

by Ofir Gorodetsky and Brad Rodgers PDF
Trans. Amer. Math. Soc. 374 (2021), 4579-4638 Request permission

Abstract:

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm {U}(n,\mathbb {C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots ,M^k$ converge in distribution to independent normal variables as $n \to \infty$, and Johansson proved that the rate of convergence is superexponential in $n$.

We prove a finite field analogue of these results. Fixing a prime power $q = p^r$, we choose a matrix $M$ uniformly from the finite unitary group $\mathrm {U}(n,q)\subseteq \mathrm {GL}(n,q^2)$ and show that the traces of $\{ M^i \}_{1 \le i \le k, p \nmid i}$ converge to independent uniform variables in $\mathbb {F}_{q^2}$ as $n \to \infty$. Moreover we show the rate of convergence is exponential in $n^2$. We also consider the closely related problem of the rate at which characteristic polynomial of $M$ equidistributes in ‘short intervals’ of $\mathbb {F}_{q^2}[T]$. Analogous results are also proved for the general linear, special linear, symplectic and orthogonal groups over a finite field. In the two latter families we restrict to odd characteristic.

The proofs depend upon applying techniques from analytic number theory over function fields to formulas due to Fulman and others for the probability that the characteristic polynomial of a random matrix equals a given polynomial.

References
Similar Articles
Additional Information
  • Ofir Gorodetsky
  • Affiliation: Mathematical Institute, University of Oxford, Oxford, OX2 6GG, United Kingdom
  • MR Author ID: 1234845
  • Email: ofir.goro@gmail.com
  • Brad Rodgers
  • Affiliation: Department of Mathematics and Statistics, Queen’s University, Kingston, Ontario K7L 3N6, Canada
  • MR Author ID: 1049692
  • Email: brad.rodgers@queensu.ca
  • Received by editor(s): September 22, 2019
  • Published electronically: April 28, 2021
  • Additional Notes: The first author was supported by the European Research Council under the European Union’s Seventh Frame-work Programme (FP7/2007-2013)/ERC grant agreements n$^{\text {o}}$ 320755 and 786758. The second author was partly supported by the US NSF grant DMS-1701577 and an NSERC grant.
  • © Copyright 2021 American Mathematical Society
  • Journal: Trans. Amer. Math. Soc. 374 (2021), 4579-4638
  • MSC (2020): Primary 60B15, 60B20, 20G40, 11T55
  • DOI: https://doi.org/10.1090/tran/8337
  • MathSciNet review: 4273172