The Motzkin enumeration conjecture for good tableaux
Let be a standard tableau, and call good when every permutation satisfying is BBS good, equivalently when is the recording tableau of some good permutation. Motzkin conjecture. The number of size- good tableaux is equal to the th Motzkin number. Motzkin numbers also enumerate several classical objects, but the asserted enumeration of good recording tableaux remains open.
References
Primary source
Marisa Cofie, Olivia Fugikawa, Emily Gunawan, Madelyn Stewart and David Zeng, “Box-ball systems and RSK recording tableaux”, arXiv:2209.09277 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.