See this document in CiteSeerX!

Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic Arrays (2003)  (Make Corrections)  
E. Strahov



  Home/Search   Context   Related

 
View or download:
combinatorics.org/Volume...v10i1r24.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  combinatorics.org/Volu...v10i1toc (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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 subsequence problems (such as the last passage percolation problem). (Update)

Active bibliography (related documents):   More   All
1.2:   Moments of Characteristic Polynomials Enumerate Two-Rowed.. - Strahov (2003)   (Correct)
0.4:   Longest Increasing Subsequences: From Patience Sorting to.. - Aldous, Diaconis (1999)   (Correct)
0.2:   Symmetrized Random Permutations - Baik, Rains (1999)   (Correct)

Similar documents based on text:   More   All
0.7:   Products and Ratios of Characteristic Polynomials of Random.. - Baik, al. (2003)   (Correct)
0.3:   Construction heuristics for the asymmetric TSP - Glover, Gutin, al. (2000)   (Correct)
0.2:   Individual Differences in Virtual Environments.. - Chen, Czerwinski.. (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ strahov-moments,
  author = "E. Strahov",
  title = "Moments of Characteristic Polynomials Enumerate Two-Rowed Lexicographic
    Arrays",
  url = "citeseer.ist.psu.edu/article/strahov03moments.html" }
Citations (may not include all citations):
47   the distribution of the length of the longest increasing sub.. - Baik, Deift et al. - 1999
47   Symmetric functions and P-recursiveness (context) - Gessel - 1990
34   Cambridge University Press (context) - Fulton - 1997
15   Random Matrix Theory and - Keating, Snaith - 2000
15   Longest increasing subsequences: from patience sorting to th.. - Aldous, Diaconis - 1999
14   Increasing subsequences and the classical groups - Rains - 1998
9   Random vicious walks and random matrices - Baik - 2000
6   Algebraic aspects of increasing subsequences - Baik, Rains - 1999
5   the Distributions of the Lengths of the Longest Monotone Sub.. (context) - Tracy, Widom - 1999
2   Riemann-Hilbert problems for last passage percolation - Baik - 2001

Documents on the same site (http://www.combinatorics.org/Volume_10/v10i1toc.html):   More
A Note on Graph Coloring Extensions and List-Colorings - Axenovich (2003)   (Correct)
Packing 10 or 11 Unit Squares in a Square - Stromquist (2003)   (Correct)
Global Defensive Alliances in Graphs - Haynes, Hedetniemi, Henning (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC