Permutations without long decreasing subsequences and random matrices

Details Permutations without long decreasing subsequences and random matrices Permutations without long decreasing subsequences and random matrices

2006-03-16

arxiv.org/abs/math/0603401v2

Electron. J. Combin. 14(1), 2007, Research Paper 11

Mathematics

Combinatorics

11 pages

Scientific paper

We study the shape of the Young diagram \lambda associated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other words we study the restriction of the Plancherel measure to Young diagrams with at most d rows. We prove that in the limit n\to\infty the rows of \lambda behave like the eigenvalues of a certain random matrix (traceless Gaussian Unitary Ensemble) with d rows and columns. In particular, the length of the longest increasing subsequence of such a random permutation behaves asymptotically like the largest eigenvalue of the corresponding random matrix.

Affiliated with

Also associated with

No associations

Rating

Permutations without long decreasing subsequences and random matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Permutations without long decreasing subsequences and random matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutations without long decreasing subsequences and random matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-481324