Open AccessInvestigation of insertion tableau evolution in the Robinson-Schensted-Knuth correspondence
Author(s) -
Vasilii Duzhin,
Vasilii Duzhin
Publication year - 2019
Publication title -
discrete and continuous models and applied computational science
Language(s) - English
Resource type - Journals
eISSN - 2658-7149
pISSN - 2658-4670
DOI - 10.22363/2658-4670-2019-27-4-316-324
Subject(s) - young tableau , bijection , combinatorics , set (abstract data type) , mathematics , sequence (biology) , computer science , programming language , biology , genetics
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.