Abstract
We consider the problem of finding all the permutations corresponding to a given Young tableau. We introduce a recursive algorithm, deleting the elements from the tableau in reverse order which were inserted by the Schensted algorithm.
Citation
Erikki Mäkinen. Jyrki Nummenmaa. "Finding the Permutations Corresponding to a Given Young Tableau." Missouri J. Math. Sci. 19 (2) 84 - 92, May 2007. https://doi.org/10.35834/mjms/1316092488
Information
