vix.ing · top · new · best · stats

On the Distribution of the Length of the Longest Increasing Subsequence of Random Permutations

1998/10/31 by Jinho Baik, Percy Deift, Kurt Johansson · 17 citations
Mathematics · Physics and Astronomy · #math.CO #math-ph #math.MP #nlin.SI #solv-int #msc:05A05 #msc:15A52 #msc:33D45 #msc:45E05 #msc:60F99

paper · pdf

published as J. Amer. Math. Soc. 12 (1999), no. 4, 1119--1178 · 60 pages, 14 figures, AMS-LaTeX, typo correstions, new references

arxiv created 1999/03/26 · arxiv updated 2009/11/30

Abstract

The authors consider the length, lN, of the length of the longest increasing subsequence of a random permutation of N numbers. The main result in this paper is a proof that the distribution function for lN, suitably centered and scaled, converges to the Tracy-Widom distribution [TW1] of the largest eigenvalue of a random GUE matrix. The authors also prove convergence of moments. The proof is based on the steepest decent method for Riemann-Hilbert problems, introduced by Deift and Zhou in 1993 [DZ1] in the context of integrable systems. The applicability of the Riemann-Hilbert technique depends, in turn, on the determinantal formula of Gessel [Ge] for the Poissonization of the distribution function of lN.

Cited by

Related