Permutations without long decreasing subsequences and random matrices
From MaRDI portal
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.
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
Cited in
(9)- Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- scientific article; zbMATH DE number 1549030 (Why is no real title available?)
- Random permutations and the discrete Bessel kernel
- GL(n, q) and increasing subsequences in non-uniform random permutations
- An asymptotic version of a theorem of Knuth
- Monotonous subsequences and the descent process of invariant random permutations
- Permutations with short monotone subsequences
- 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)
