2000 character limit reached
Finite Gröbner--Shirshov bases for Plactic algebras and biautomatic structures for Plactic monoids (1205.4885v3)
Published 22 May 2012 in math.RA and math.GR
Abstract: This paper shows that every Plactic algebra of finite rank admits a finite Gr\"obner--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 $FP_\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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.