RSK tableaux and box-ball systems

From MaRDI portal
Publication:6138911

DOI10.5070/C63261978zbMATH Open1527.05005arXiv2112.03780OpenAlexW4386745563MaRDI QIDQ6138911FDOQ6138911


Authors: Ben Drucker, Eli Garcia, Emily Gunawan, Rose Silver Edit this on Wikidata


Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Abstract: A box-ball system is a discrete dynamical system whose dynamics come from the balls jumping according to certain rules. A permutation on n objects gives a box-ball system state by assigning its one-line notation to n consecutive boxes. After a finite number of steps, a box-ball system will reach a steady state. From any steady state, we can construct a tableau called the soliton decomposition of the box-ball system. We prove that if the soliton decomposition of a permutation w is a standard tableau or if its shape coincides with the Robinson-Schensted (RS) partition of w, then the soliton decomposition of w and the RS insertion tableau of w are equal. We also use row reading words, Knuth moves, RS recording tableaux, and a localized version of Greene's theorem (proven recently by Lewis, Lyu, Pylyavskyy, and Sen) to study various properties of a box-ball system.


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




Recommendations




Cites Work






This page was built for publication: RSK tableaux and box-ball systems

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