Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731)

The plactic monoid \(M_n\) with finite generating set \(A=\{1,2,\ldots,n\}\) is considered. Recall that the elements of \(M_n\) are in a one-to-one correspondence with semistandard Young tableaux, see \textit{A. Lascoux, B. Leclerc} and \textit{J.-Y. Thibon} [Algebraic combinatorics on words. Cambridge: Cambridge Univ. Press (2002; Zbl 1001.68093)]. A presentation of \(M_n\) based on the set of generators consisting of all columns (defined as the decreasing words) and with the set of defining relations, each involving a word of length \(2\) and a word of length at most \(2\) in these generators, is given. A finite complete rewriting system is derived, which leads to a finite Gröbner-Shirshov basis for the corresponding semigroup algebra, with respect to the degree-lexicographic order. The latter construction was independently obtained by \textit{L. A. Bokut} et al. [J. Algebra 423, 301-317 (2015; Zbl 1309.16014)]. It follows that plactic monoids of finite rank have finite derivation type and satisfy the homological finiteness properties left and right \(FP_\infty\). The constructed rewriting system is also applied to show that plactic monoids of finite rank are biautomatic, with respect to the usual generating set \(A\).