Investigation of insertion tableau evolution in the Robinson-Schensted-Knuth correspondence
Journal: Discrete and Continuous Models and Applied Computational Science (Vol.27, No. 4)Publication Date: 2020-02-19
Authors : Vasilii Duzhin;
Page : 316-324
Keywords : Robinson-Schensted-Knuth correspondence; Young tableaux; Young graph; Markov process; central measure; Plancherel measure; asymptotic representation theory;
Abstract
Robinson-Schensted-Knuth (RSK) correspondence occurs in different contexts of algebra and combinatorics. Recently, this topic has been actively investigated by many researchers. At the same time, many investigations require conducting the computer experiments involving very large Young tableaux. The article is devoted to such experiments. RSK algorithm establishes a bijection between sequences of elements of linearly ordered set and the pairs of Young tableaux of the same shape called insertion tableau and recording tableau . In this paper we study the dynamics of tableau and the dynamics of different concrete values in tableau during the iterations of RSK algorithm. Particularly, we examine the paths within tableaux called bumping routes along which the elements of an input sequence pass. The results of computer experiments with Young tableaux of sizes up to 108 were presented. These experiments were made using the software package for dealing with 2D and 3D Young diagrams and tableaux.
Other Latest Articles
- Review and comparative analysis of machine learning libraries for machine learning
- Kinematic support modeling in Sage
- Spinor field in a spherically symmetric Friedmann Universe
- Applying Friedmann models to describe the evolution of the Universe based on data from the SAI Supernovae Catalog
- Comparative analysis of machine learning methods by the example of the problem of determining muon decay
Last modified: 2020-08-31 19:27:45