The same-recording-tableau conjecture for steady-state time
The same-recording-tableau conjecture for steady-state time
For permutations , let and denote their recording tableaux under the Robinson–Schensted correspondence. The steady-state time is the number of box-ball-system moves required for a permutation to reach steady state. Same-recording-tableau conjecture. If
then and have the same steady-state time. The source reports that this conjecture was proved in a sequel to the paper.
Sources & referencesView supporting material
Primary source
Ben Drucker, Eli Garcia, Emily Gunawan, Aubrey Rumbolt and Rose Silver, “RSK tableaux and box-ball systems”, arXiv:2112.03780 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.