We give simple procedures to obtain the left and right keys of a semi-standard Young tableau.
Characterization of ${\cal B}(\infty)$ using marginally large tableaux and rigged configurations in the $A_n$ case via integer sequences
A Decomposition of Schur functions and an analogue of the Robinson-Schensted-Knuth Algorithm
A non-crossing standard monomial theory
![QR code for arXiv:2302.08279 [math.CO]](http://oss.arxitics.com/images/favicon.svg)