Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

@article{Aldous1999LongestIS,
  title={Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem},
  author={D. Aldous and P. Diaconis},
  journal={Bulletin of the American Mathematical Society},
  year={1999},
  volume={36},
  pages={413-432}
}
  • D. Aldous, P. Diaconis
  • Published 1999
  • Mathematics
  • Bulletin of the American Mathematical Society
  • We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants. 
    398 Citations
    Enumerating longest increasing subsequences and patience sorting
    • 88
    • PDF
    The Surprising Mathematics of Longest Increasing Subsequences
    • 151
    • PDF
    Combinatorics of patience sorting piles
    • 20
    • Highly Influenced
    • PDF
    Ju n 20 05 Combinatorics of Patience Sorting Piles
    Longest Increasing Subsequences and Random Matrices
    • 1
    • PDF
    Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
    • 25
    • PDF
    Patience Sorting and Its Generalizations
    • 1
    • PDF

    References

    SHOWING 1-10 OF 87 REFERENCES
    Longest Increasing Subsequences of Random Colored Permutations
    • A. Borodin
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 1999
    • 36
    • PDF
    On Increasing Subsequences of Random Permutations
    • J. H. Kim
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 1996
    • 31
    • PDF
    Hammersley's interacting particle process and longest increasing subsequences
    • 186
    Longest Increasing and Decreasing Subsequences
    • 699
    • PDF
    Random matrices and ramdom permutations
    • 180
    • PDF
    Increasing Subsequences and the Classical Groups
    • E. Rains
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 1998
    • 114
    • PDF
    Algebraic aspects of increasing subsequences
    • 163
    • PDF
    Ignatov's Theorem: A New and Short Proof. Research Report 87-3.
    • 13
    Random Unitary Matrices, Permutations and Painlevé
    • 91
    • PDF
    On computing the length of longest increasing subsequences
    • M. Fredman
    • Mathematics, Computer Science
    • Discret. Math.
    • 1975
    • 217