Question

Longest increasing subsequences: from patience sorting to the baik-deift- johansson theorem

Answer 1

Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. 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.

Answer 2

Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. 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.