×

Finding the permutations corresponding to a given Young tableau. (English) Zbl 1184.05003

Summary: 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.

MSC:

05A05 Permutations, words, matrices
05E10 Combinatorial aspects of representation theory
68R05 Combinatorics in computer science
PDF BibTeX XML Cite