Robinson Schensted Research Articles

The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm

Connections between the Robinson–Schensted–Knuth algorithm, random infinite Young tableaux, and central indecomposable measures are investigated. A generalization of the RSK algorithm leads to a combinatorial interpretation of extended Schur functions. Applications are given to Ulam’s problem on longest increasing subsequences and to a law of large numbers for representations. An analogous theory for other graphs is discussed.