Moments of characteristic polynomials enumerate two-rowed lexicographic arrays

From MaRDI portal
(Redirected from Publication:1408528)



Abstract: A combinatorial interpretation is provided for the moments of characteristic polynomials of random unitary matrices. This leads to a rather unexpected consequence of the Keating and Snaith conjecture: the moments of midxi(1/2+it)mid turn out to be connected with some increasing subsequences problems (such as the last passage percolation problem).


The author gives an interpretation of moments of characteristic polynomials of random unitary matrices in terms of counts of two-rowed lexicographic arrays whose weakly increasing subsequences have at most \(N\) elements. This connects the theory of these moments to last passage percolation theory, and gives a new interpretation of the conjecture \textit{J. P. Keating} and \textit{N. C. Snaith} [Commun. Math. Phys. 214, 57--89 (2000; Zbl 1051.11048)].











This page was built for publication: Moments of characteristic polynomials enumerate two-rowed lexicographic arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408528)