Super jeu de taquin and combinatorics of super tableaux of type A

Abstract

This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Schützenberger's jeu de taquin on the structure of super tableaux over a signed alphabet. We show that this procedure which transforms super skew tableaux into super Young tableaux is compatible with the super plactic congruence and it is confluent. We deduce properties relating the super jeu de taquin to insertion algorithms on super tableaux. Moreover, we introduce the super evacuation procedure as an involution on super tableaux and we show its compatibility with the super plactic congruence. Finally, we describe the super jeu de taquin in terms of Fomin's growth diagrams in order to give a combinatorial version of the super Littlewood--Richardson rule.

arXiv comment22 pages

References in corpus (8)

• Crystal Graphs and $q$-Analogues of Weight Multiplicities for the Root System $A_n$
• The Littlewood-Richardson rule, and related combinatorics
• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• Parastatistics Algebra, Young Tableaux and the Super Plactic Monoid
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
• Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$
• Finite convergent presentation of plactic monoid for type C
• Chinese syzygies by insertions

Cited by in corpus (1)

• A super Littlewood--Richardson type rule