Papers
Topics
Authors
Recent
2000 character limit reached

New approaches to plactic monoid via Gröbner-Shirshov bases (1106.4753v3)

Published 23 Jun 2011 in math.RA

Abstract: We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-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 \cite{Knuth} in 1970, see also Chapter 5 in \cite{M.L}.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.