Permutations without long decreasing subsequences and random matrices
From MaRDI portal
Publication:870067
zbMATH Open1113.05100arXivmath/0603401MaRDI QIDQ870067FDOQ870067
Publication date: 12 March 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: 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 oinfty 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.
Full work available at URL: https://arxiv.org/abs/math/0603401
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On the distribution of the length of the longest increasing subsequence of random permutations
- The longest increasing subsequence in a random permutation and a unitary random matrix model
- Permutations with short monotone subsequences
- The asymptotics of monotone subsequences of involutions
- scientific article; zbMATH DE number 1549030
Random matrices (algebraic aspects) (15B52) Brownian motion (60J65) Combinatorial aspects of representation theory (05E10)
Cited In (6)
- GL(n, q) and increasing subsequences in non-uniform random permutations
- An asymptotic version of a theorem of Knuth
- Title not available (Why is that?)
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- Random permutations and the discrete Bessel kernel
- Random unitary matrices, permutations and Painlevé
This page was built for publication: Permutations without long decreasing subsequences and random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870067)
