The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
Authors:
- Sergei V. KerovSKSergei V. Kerov
- Anatol M. VershikAVAnatol M. Vershik
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (1) , 116-124
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Hook young diagrams with applications to combinatorics and to representations of Lie superalgebrasAdvances in Mathematics, 1987
- Unimodality and Lie SuperalgebrasStudies in Applied Mathematics, 1985
- The combinatorics of (𝑘,𝑙)-hook Schur functions1984
- The Representation of Partition StructuresJournal of the London Mathematical Society, 1978
- A variational problem for random Young tableauxAdvances in Mathematics, 1977
- Combinatoire et Représentation du Groupe Symétrique1977
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- Theory and Application of Plane Partitions: Part 1Studies in Applied Mathematics, 1971
- Permutations, matrices, and generalized Young tableauxPacific Journal of Mathematics, 1970
- Die unzerlegbaren, positiv-definiten Klassenfunktionen der abz hlbar unendlichen, symmetrischen GruppeMathematische Zeitschrift, 1964