Iterating the RSK bijection
From MaRDI portal
Publication:2233376
DOI10.2140/INVOLVE.2021.14.475zbMATH Open1475.05006arXiv2103.04707OpenAlexW3184628781MaRDI QIDQ2233376FDOQ2233376
Authors: Jacob Hocevar, Ananya Kulshrestha, Kosha Upadhyay, Maria Monks Gillespie 
Publication date: 18 October 2021
Published in: Involve (Search for Journal in Brave)
Abstract: We investigate the dynamics of the well-known RSK bijection on permutations when iterated on various reading words of the recording tableau. In the setting of the ordinary (row) reading word, we show that there is exactly one fixed point per partition shape, and that it is always reached within two steps from any starting permutation. We also consider the modified dynamical systems formed by iterating RSK on the column reading word and the reversed reading word of the recording tableau. We show that the column reading word gives similar dynamics to the row reading word. On the other hand, for the reversed reading word, we always reach either a 2-cycle or fixed point after two steps. In fact, we reach a fixed point if and only if the shape of the initial tableau is self-conjugate.
Full work available at URL: https://arxiv.org/abs/2103.04707
Recommendations
- On the Lipschitz constant of the RSK correspondence
- RSK in last passage percolation: a unified approach
- Permutations whose reverse shares the same recording tableau in the RS correspondence
- Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
- Super RSK correspondence with symmetry
Cites Work
Cited In (1)
This page was built for publication: Iterating the RSK bijection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233376)
