New approaches to plactic monoid via Gröbner-Shirshov bases. (Q479745): Difference between revisions

The semigroup algebra of the plactic monoid \(Pl(A)\) with finite generating set \(A=\{1,2,\ldots ,n\}\), over a field \(F\), is considered. Recall that the elements of \(Pl(A)\) are in a one-to-one correspondence with semistandard Young tableaux, [see \textit{A. Lascoux, B. Leclerc, J.-Y. Thibon} in Algebraic combinatorics on words. Cambridge: Cambridge University Press (2002; Zbl 1001.68093)]. A presentation of \(Pl(A)\) (whence also of the algebra) based on the set of generators consisting of all rows (defined as the non-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. Then it is shown that this presentation yields a Gröbner-Shirshov basis of the algebra, with respect to the deg-lex order coming from a natural ordering of the set of all rows. The second main result shows that a Gröbner-Shirshov basis is also obtained from another presentation of the monoid \(Pl(A)\). Namely, a presentation based on the set of generators consisting of all columns (strictly decreasing words) and with the defining relations again of the same type. This Gröbner-Shirshov basis is finite. The latter construction was independently obtained by \textit{A. J. Cain} et al. [J. Algebra 423, 37-53 (2015; Zbl 1311.20055)], who also obtained further combinatorial properties of \(Pl(A)\), using this presentation. Notice also that it was observed by \textit{Ł. Kubat} and the reviewer that the natural presentation of \(Pl(A)\) yields a finite Gröbner-Shirshov basis (with respect to the natural deg-lex order on \(A\)) exactly when \(n\leq 3\) [Algebra Colloq. 21, No. 4, 591-596 (2014; Zbl 1304.16026)].