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 turn out to be connected with some increasing subsequences problems (such as the last passage percolation problem).
Recommendations
- Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
- On the moments of the moments of the characteristic polynomials of random unitary matrices
- Increasing subsequences and the classical groups
- Random matrices, magic squares and matching polynomials
- On the joint moments of the characteristic polynomials of random unitary matrices
Cited in
(5)- Counting formulas associated with some random matrix averages
- On absolute moments of characteristic polynomials of a certain class of complex random matrices
- Characteristic polynomials of random Hermitian matrices and Duistermaat-Heckman localisation on non-compact Kähler manifolds
- On the moments of characteristic polynomials
- Moments of moments and branching random walks
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)