On the moments of moments of random matrices and Ehrhart polynomials
Theodoros Assiotis, Edward Eriksson, Wenqi Ni

TL;DR
This paper studies the polynomial behavior and symmetry of moments of moments of characteristic polynomials of random matrices, using Ehrhart-Macdonald reciprocity and lattice point bijections.
Contribution
It classifies the integer roots of these polynomials and proves their symmetry, confirming predictions from Bailey's thesis.
Findings
Classified the integer roots of the moments of moments polynomials.
Proved the symmetry property of these polynomials.
Connected the polynomials' properties to Ehrhart-Macdonald reciprocity.
Abstract
There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size goes to infinity. These quantities depend on two parameters and and when both of them are positive integers it has been shown that these moments are in fact polynomials in the matrix size . In this paper we classify the integer roots of these polynomials and moreover prove that the polynomials themselves satisfy a certain symmetry property. This confirms some predictions from the thesis of Bailey. The proof uses the Ehrhart-Macdonald reciprocity for rational convex polytopes and certain bijections between lattice points in some polytopes.
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 Combinatorial Mathematics · Advanced Algebra and Geometry · Random Matrices and Applications
