Piotr Śniady
Published 2013-07-22, updated 2016-09-01Version 3
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.
Comments: 42 pages. Version 2: change of title, minor changes. Version 3: bibliography has been updated, the figures which in version 2 were not displayed properly have been repaired
Journal: SIAM J. Discrete Math. 28 (2014), no. 2, 598-630
A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
A $q$-Robinson-Schensted-Knuth Algorithm and a $q$-polymer
Poisson limit of bumping routes in the Robinson-Schensted correspondence
![QR code for arXiv:1307.5645 [math.CO]](http://oss.arxitics.com/images/favicon.svg)