Crystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$.

Citation:
Cain, A. J., R. D. Gray, and A. Malheiro Crystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$.., Submitted.

Abstract:

This paper constructs presentations via finite complete rewriting systems for plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$, using a unified proof strategy that depends on Kashiwara's crystal bases and analogies of Young tableaux, and on Lecouvey's presentations for these monoids. As corollaries, we deduce that plactic monoids of these types have finite derivation type and satisfy the homological finiteness properties left and right $\mathrm{FP}_\infty$. These rewriting systems are then applied to show that plactic monoids of these types are biautomatic.

Notes:

Submitted