Finite convergent presentation of plactic monoid for type C

Abstract

We give an explicit presentation for the plactic monoid for type C using admissible column generators. Thanks to the combinatorial properties of symplectic tableaux, we prove that this presentation is finite and convergent. We obtain as a corollary that plactic monoids for type C satisfy homological finiteness properties.

Cited by in corpus (4)

• 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$
• Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson--Schensted--Knuth-type correspondence for quasi-ribbon tableaux
• Super jeu de taquin and combinatorics of super tableaux of type A
• A super Littlewood--Richardson type rule