The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm
The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm
复制标题
无限对称群的特征及Robinson-Schensted-Knuth算法的概率性质
DOI：
10.1137/0607014
复制
发表时间：
1986
期刊：
影响因子：
--
通讯作者：
A. Vershik
中科院分区：
文献类型：
--
作者：
S. Kerov;A. Vershik
研究了Robinson-Schensted-Knuth算法、随机无限Young表和中心不可分解测度之间的关系。RSK算法的推广导致了扩展Schur函数的组合解释。给出了关于最长递增子序列的Ulam问题和表示的大数定律的应用。文中还讨论了其他图的类似理论。
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.