There exists a well-known hook-length formula for calculating the dimensions of two-dimensional Young diagrams. Unfortunately, an analogous formula for the three-dimensional case is unknown. We introduce an approach to calculating estimated dimensions of three-dimensional Young diagrams, also known as plane partitions. The most difficult part of this task is the calculation of the cotransition probabilities for a central Markov process. We suggest an algorithm for an approximate calculation of these probabilities. It generates numerous random paths to a given diagram. In the case where the generated paths are uniformly distributed, the proportion of paths passing through a certain edge gives us an approximate value of the cotransition probability. As our numerical experiments show, a random generator based on the randomized version of the Schützenberger transformation allows one to obtain accurate values of cotransition probabilities. Also, a method for constructing three-dimensional Young diagrams with large dimensions is suggested. Bibliography: 13 titles.
Similar content being viewed by others
Change history
References
M. P. Schützenberger, “Quelques remarques sur une construction de Schensted,” Math. Scand., 12, 117–128 (1963).
S. V. Fomin, “Knuth equivalence, jeu de taquin, and the Littlewood–Richardson rule,” in: R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge Univ. Press (1999), Appendix 1 to Chap. 7.
D. Romik and P. Śniady, “Jeu de taquin dynamics on infinite Young tableaux and second class particles,” Ann. Prob., 43, No. 2, 682–737 (2015).
A. Vershik, “Combinatorial encoding of continuous dynamics, and transfer of the space of paths of the graded graphs,” arXiv:1904.10938 (2019).
A. Vershik and D. Pavlov, “Numerical experiments in problems of asymptotic representation theory,” Zap. Nauchn. Semin. POMI, 373, 77–93 (2009).
N. N. Vasilyev and V. S. Duzhin, “Building irreducible representations of a symmetric group S(n) with large and maximum dimensions,” Inform.-uprav. sistemy , No. 3, 17–22 (2015).
N. N. Vasilyev and V. S. Duzhin, “A study of the growth of the maximum and typical normalized dimensions of strict Young diagrams,” J. Math. Sci., 216, 53–64 (2016).
V. S. Duzhin and N. N. Vasilyev, “Asymptotic behavior of normalized dimensions of standard and strict Young diagrams – growth and oscillations,” J. Knot Theory Ramifications, 25, No. 12 (2016).
N. N. Vasiliev and V. S. Duzhin, “Numerical investigation of the asymptotics of the probabilities of paths in a Markov process on the 3D Young graph close to a central one,” Zap. Nauchn. Semin. POMI, 448, 69–79 (2016).
V. Duzhin and N. Vasilyev, “Modeling of an asymptotically central Markov process on 3D Young graph,” Math. Comput. Sci., 11, No. 3–4, 315–328 (2017).
N. N. Vasiliev and A. B. Terentjev, “Modelling of almost central measures generated by Markov processes in the three-dimensional case,” J. Math. Sci., 209, No. 6, 851–859 (2015).
S. V. Kerov, “Transition probabilities for continual Young diagrams and the Markov moment problem,” Funct. Anal. Appl., 27, No. 2, 104–117 (1993).
A. M. Vershik and S. V. Kerov, “Asymptotic behavior of the maximum and generic dimensions of irreducible representations of the symmetric group,” Funct. Anal. Appl., 19, 21–31 (1985).
Author information
Authors and Affiliations
Corresponding author
Additional information
Published in Zapiski Nauchnykh Seminarov POMI, Vol. 478, 2019, pp. 90–106.
Rights and permissions
About this article
Cite this article
Duzhin, V., Vassiliev, N. Randomized Schützenberger’s Jeu De Taquin and Approximate Calculation of the Cotransition Probabilities of a Central Markov Process on the 3D Young Graph. J Math Sci 251, 363–374 (2020). https://doi.org/10.1007/s10958-020-05097-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-020-05097-1