Shuffle Invariance of the Super-RSK Algorithm

✍ Scribed by Amitai Regev; Tamar Seeman

• Book ID: 102559640
• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 182 KB
• Volume: 28
• Category: Article
• ISSN: 0196-8858
• DOI: 10.1006/aama.2001.0767

✦ Synopsis

As in the k l -RSK (Robinson-Schensted-Knuth) of A. Berele and A. Regev (1987, Adv. Math. 64, 118-175), other super-RSK algorithms can be applied to sequences of variables from the set

While the k l -RSK is the case where t i < u j for all i and j, these other super-RSK's correspond to all the k+l k shuffles of the t's and u's satisfying the above restrictions that t

We show that the shape of the tableaux produced by any such super-RSK is independent of the particular shuffle of the t's and u's.  2002 Elsevier Science (USA)