Back to Search Start Over

A schensted algorithm for rim hook tableaux

Authors :
Dennis E. White
Dennis Stanton
Source :
Journal of Combinatorial Theory, Series A. 40:211-247
Publication Year :
1985
Publisher :
Elsevier BV, 1985.

Abstract

We consider hooks, hook tableaux, rim hooks, and rim hook tableaux where all hooks and rim hooks have length k . Using a rim hook version of the “jeu d'taquin” of Schutzenberger and the orientation of a rim hook (its mod k distance from the main diagonal), we give a simple alternative description of the ∗-diagrams of Robinson. The rim hook Schensted correspondence given by one of us in a previous paper then decomposes into a k -tuple of ordinary Schensted correspondences. This decomposition is used to “lift” the important applications of the ordinary Schensted correspondence to the rim hook Schensted correspondence. These include applications to inverses, increasing and decreasing subsequences, and the Schutzenberger evacuation procedure.

Details

ISSN :
00973165
Volume :
40
Database :
OpenAIRE
Journal :
Journal of Combinatorial Theory, Series A
Accession number :
edsair.doi.dedup.....fd9148ca01b3e70e20315dd71c71b179