Comments on David Aldous and Persi Diaconis' "Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem"

Abstract

This is a commentary on the article: David Aldous and Persi Diaconis, Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem, Bull. Amer. Math. Soc. 36 (1999), no. 4, 413-432.

arXiv comment10 pages, 6 figures

References in corpus (8)

• Level-Spacing Distributions and the Airy Kernel
• Quantum Inverse Scattering Method and Correlation Functions
• Asymptotics in ASEP with Step Initial Condition
• The one-dimensional KPZ equation and its universality class
• The KPZ fixed point
• A stochastic Burgers equation from a class of microscopic interactions
• $t^{1/3}$ Superdiffusivity of Finite-Range Asymmetric Exclusion Processes on $\mathbb{Z}$
• Universality of KPZ equation

Cited by in corpus (2)

• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
• Empirical scaling of the length of the longest increasing subsequences of random walks