RSK tableaux and box-ball systems
From MaRDI portal
Publication:6138911
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.
Recommendations
- Box-ball systems and RSK tableaux
- Box-ball systems and Robinson-Schensted-Knuth correspondence
- The ghost-box-ball system: a unified perspective on soliton cellular automata, the RSK algorithm and phase shifts
- Scaling limit of soliton lengths in a multicolor box-ball system
- BBS invariant measures with independent soliton components
Cites work
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- An extension of Schensted's theorem
- Box and ball system with a carrier and ultradiscrete modified KdV equation
- Box-ball systems and Robinson-Schensted-Knuth correspondence
- Combinatorics of Coxeter Groups
- Combinatorics: the art of counting
- Longest Increasing and Decreasing Subsequences
- Permutations, matrices, and generalized Young tableaux
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)