Constructing finite complete rewriting systems for Plactic monoids of arbitrary finite rank

Orador: Duarte Ribeiro

Data: 21/03/2017

Hora: 14h

Local: Sala de seminários, ed. VII


The first part of this talk will be a short overview on the Plactic monoid, Young tableaux, Schensted’s algorithm and its connection to the monoid itself.

The second part will be an exposition on the result obtained by Cain, Gray and Malheiro, concerning the construction of a finite complete rewriting system for Plactic monoids of arbitrary finite rank. This rewriting system will not be over the usual generating set, instead being over the finite set of columns of Young tableaux.