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.