New approaches to plactic monoid via Gr\"obner-Shirshov bases
Abstract
We present the plactic algebra on an arbitrary alphabet set A by row generators and column generators respectively. We give Gr\"obner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"obner-Shirshov basis is given if A is finite. From the Composition-Diamond lemma for associative algebras, it follows that the set of Young tableaux is a linear basis of plactic algebra. As the result, it gives a new proof that Young tableaux are normal forms of elements of plactic monoid. This result was proved by D.E. Knuth Knuth in 1970, see also Chapter 5 in M.L.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.