Open Access
Translator Disclaimer
May 2007 Finding the Permutations Corresponding to a Given Young Tableau
Erikki Mäkinen, Jyrki Nummenmaa
Missouri J. Math. Sci. 19(2): 84-92 (May 2007). DOI: 10.35834/mjms/1316092488

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

Download 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

Published: May 2007
First available in Project Euclid: 15 September 2011

zbMATH: 1184.05003
Digital Object Identifier: 10.35834/mjms/1316092488

Subjects:
Primary: 68R05
Secondary: 05E10

Rights: Copyright © 2007 Central Missouri State University, Department of Mathematics and Computer Science

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.19 • No. 2 • May 2007
Back to Top