Robinson-Schensted-Knuth algorithm, jeu de taquin and Kerov-Vershik measures on infinite tableaux
classification
🧮 math.CO
math.PR
keywords
infiniterandomtaquinalgorithmequippedrobinson-schensted-knuthtableaubernoulli
read the original abstract
We investigate Robinson-Schensted-Knuth algorithm (RSK) and Sch\"utzenberger's jeu de taquin in the infinite setup. We show that the recording tableau in RSK defines an isomorphism of the following two dynamical systems: (i) a sequence of i.i.d. random letters equipped with Bernoulli shift, and (ii) a random infinite Young tableau (with the distribution given by Vershik-Kerov measure, corresponding to some Thoma character of the infinite symmetric group) equipped with jeu de taquin transformation. As a special case we recover the results on non-colliding random walks and multidimensional Pitman transform.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.