Permutations without long decreasing subsequences and random matrices
| dc.creator | Sniady, Piotr | |
| dc.date | 2006-03-16 | |
| dc.date | 2006-12-31 | |
| dc.date.accessioned | 2026-07-07T07:43:18Z | |
| dc.date.available | 2026-07-07T07:43:18Z | |
| dc.description | We study the shape of the Young diagram λ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 λ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. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/math/0603401 | |
| dc.identifier | http://arxiv.org/abs/math/0603401 | |
| dc.identifier | Electron. J. Combin. 14(1), 2007, Research Paper 11 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/122770 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05E10, 15A52, 60J65 | |
| dc.title | Permutations without long decreasing subsequences and random matrices | |
| dc.type | text |