Subject
Applied Mathematics,Analysis
Reference10 articles.
1. S. V. Kerov and A. M. Vershik, “The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm,” SIAM J. Algebraic Discrete Methods, 7:1 (1986), 116–124.
2. P. Sniady, “Robinson-Schensted-Knuth algorithm, jeu de taquin and Kerov-Vershik measures on infite tableaux,” SIAM J. Deiscrete Math., 28:2 (2014), 598–630.
3. D. Romik and P. Sniady, “Jeu de taquin dynamics on infinite Young tableaux and second class particles,” Ann. Probab., 43:2 (2015), 682–737.
4. A. M. Vershik, “Three theorems on the uniqueness of a Plancherel measure from different viewpoints,” Trudy MIAN, 2019 (to appear).
5. R. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献