Finite Gröbner--Shirshov bases for Plactic algebras and biautomatic structures for Plactic monoids

Abstract

This paper shows that every Plactic algebra of finite rank admits a finite Gröbner--Shirshov basis. The result is proved by using the combinatorial properties of Young tableaux to construct a finite complete rewriting system for the corresponding Plactic monoid, which also yields the corollaries that Plactic monoids of finite rank have finite derivation type and satisfy the homological finiteness properties left and right $F{P}_{\infty }$. Also, answering a question of Zelmanov, we apply this rewriting system and other techniques to show that Plactic monoids of finite rank are biautomatic.

16 pages; 3 figures. Minor revision: typos fixed; figures redrawn; references updated

Cited by in corpus (8)

• 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$
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
• Finite convergent presentation of plactic monoid for type C
• Quadratic normalisation in monoids
• New approaches to plactic monoid via Gröbner-Shirshov bases
• Correspondence between factorability and normalisation in monoids
• Automaticity of one-relator semigroups with length less than or equal to three
• Garside and quadratic normalisation: a survey