An Extension of Tymoczko Codes to Row Strict Young Tableaux
Résumé
In this article, we extend theories of Tymoczko codes on standard young tableaux to row strict tableau of any given shape λ, by investigating the algorithm through which permutations were associated to a set of row-strict tableaux rst. Via this algorithm, we attach a code to each rst and give some combinatorial interpretations of these codes and establish some connections between some existing results on rst and the codes.