Autocorrelation of Random Matrix Polynomials
J.B. Conrey, D.W. Farmer, J.P. Keating, M.O. Rubinstein, N.C., Snaith

TL;DR
This paper derives explicit autocorrelation formulas for characteristic polynomials of Haar-random matrices from classical groups, providing exact finite-size identities that support the link between Random Matrix Theory and L-functions.
Contribution
It presents new exact formulas for autocorrelations of characteristic polynomials of Haar-random matrices, extending previous asymptotic results to finite matrix sizes.
Findings
Explicit determinant sum, combinatorial sum, and contour integral formulas.
Formulas are valid for any matrix size, not just asymptotic regimes.
Supports the conjectured connection between Random Matrix Theory and L-functions.
Abstract
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in three equivalent forms: as a determinant sum (and hence in terms of symmetric polynomials), as a combinatorial sum, and as a multiple contour integral. These formulae are analogous to those previously obtained for the Gaussian ensembles of Random Matrix Theory, but in this case are identities for any size of matrix, rather than large-matrix asymptotic approximations. They also mirror exactly autocorrelation formulae conjectured to hold for L-functions in a companion paper. This then provides further evidence in support of the connection between Random Matrix Theory and the theory of L-functions.
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.
