Moments of characteristic polynomials enumerate two-rowed lexicographic arrays

Electronic Journal of Combinatorics

Volumn 10, Issue 1 R, 2003, Pages

  Strahov, E ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042676020     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1717     Document Type: Article

References (10)

1. Keating J. P. and Snaith N. C., Random Matrix Theory and ζ(1/2+it) 2000 Comm. Math. Phys. 214 57-89.
2. Fulton W., Young tableaux (Cambridge University Press) 1997.
3. Gessel I., Symmetric functions and P-recursiveness. 1990 J. Combin. Theory Ser. A 53 257-285.
4. Baik J., Deift P. and Johansson K., On the distribution of the length of the longest increasing subsequence of random permutations. 1999 J. Amer. Math. Soc. 12 1119-1178.
5. Aldous D. and Diaconis P., Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. 1999 Bull. Amer. Math. Soc. (N.S.) 36 413-432
6. Rains E. M., Increasing subsequences and the classical groups. 1998 Electron. J. of Combinatorics 5(1) R12.
7. Baik J. and Rains E. M., Algebraic aspects of increasing subsequences. 1999 math. CO/9905084 at xxx.lanl.gov.
8. Tracy C. A. and Widom H., On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words. 1999 math. CO/9904042 at xxx.lanl.gov.
9. Baik J., Riemann-Hilbert problems for last passage percolation. 2001 math. PR/0107079 at xxx.lanl.gov.
10. Baik J., Random vicious walks and random matrices. 2000 Comm. Pure Appl. Math. 53(11) 1385-1410.