Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux

DOI10.1137/130930169zbMATH Open1300.60025arXiv1307.5645OpenAlexW3105410390MaRDI QIDQ3192152FDOQ3192152

Piotr Śniady

Publication date: 26 September 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1307.5645

Recommendations

• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• Conditioned random walks and the RSK correspondence
• scientific article; zbMATH DE number 3966079
• Poisson limit of bumping routes in the Robinson-Schensted correspondence

zbMATH Keywords

dynamical systemYoung tableaujeu de taquinRobinson-Schensted-Knuth algorithmasymptotic representation theory of symmetric groupsisomorphism of measure-preserving systemsThoma characters of the infinite symmetric groupVershik-Kerov measures

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of representation theory (05E10) Dynamical aspects of measure-preserving transformations (37A05) Representations of finite symmetric groups (20C30) Representations of infinite symmetric groups (20C32)

Cited In (21)

• \(K\)-Knuth equivalence for increasing tableaux
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• Asymptotics of the partition of the cube into Weyl simplices and an encoding of a Bernoulli scheme
• An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases
• The Schur-Weyl graph and Thoma's theorem
• Ergodicity and totality of partitions associated with the RSK correspondence
• Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
• Three theorems on the uniqueness of the Plancherel measure from different viewpoints
• Title not available (Why is that?)
• Law of large numbers for infinite random matrices over a finite field
• Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
• Zigzag diagrams and Martin boundary
• Backward jeu de taquin slides for composition tableaux and a noncommutative Pieri rule
• Harmonic functions on multiplicative graphs and inverse Pitman transform on infinite random paths
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• A remark on the isomorphism between the Bernoulli scheme and the Plancherel measure
• Central measures on multiplicative graphs, representations of Lie algebras and weight polytopes
• The problem of combinatorial encoding of a continuous dynamics and the notion of transfer of paths in graphs
• Combinatorial encoding of Bernoulli schemes and the asymptotic behavior of Young tableaux
• Lifts, derandomization, and diameters of Schreier graphs of Mealy automata

This page was built for publication: Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192152)