论文信息 - Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays

Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays

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 |(1/ 2+ it)| turn out to be connected with some increasing subsequence problems (such as the last passage percolation problem).

E. Strahov

[1] Eric M. Rains,et al. Increasing Subsequences and the Classical Groups , 1998, Electron. J. Comb..

[2] Random vicious walks and random matrices , 2000, math/0001022.

[3] N. Snaith,et al. Random Matrix Theory and ζ(1/2+it) , 2000 .

[4] J. Baik. Riemann-Hilbert problems for last passage percolation , 2001, math/0107079.

[5] Eric M. Rains,et al. Algebraic aspects of increasing subsequences , 1999 .

[6] J. Baik,et al. On the distribution of the length of the longest increasing subsequence of random permutations , 1998, math/9810105.

[7] C. Tracy,et al. On the distributions of the lengths of the longest monotone subsequences in random words , 1999, math/9904042.

[8] P. Diaconis,et al. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem , 1999 .

[9] Ira M. Gessel,et al. Symmetric functions and P-recursiveness , 1990, J. Comb. Theory, Ser. A.