In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity. This is achieved by relating these quantities to a lattice point count problem. Our main result is a new explicit expression for the leading order coefficient in the asymptotic as a volume of a certain region involving continuous Gelfand-Tsetlin patterns with constraints.
|Number of pages||15|
|Journal||Random Matrices: Theory and Applications|
|Early online date||20 Mar 2020|
|Publication status||E-pub ahead of print - 20 Mar 2020|