Plactic monoids: a braided approach
Combinatorics
2016-12-20 v1 K-Theory and Homology
Rings and Algebras
Abstract
Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid , called \emph{plactic}. It is central in numerous combinatorial and algebraic applications. In this paper, the tableaux product is shown to be completely determined by a braiding on the (much simpler!) set of columns . Here a \emph{braiding} is a set-theoretic solution to the Yang--Baxter equation. As an application, we identify the Hochschild cohomology of , which resists classical approaches, with the more accessible braided cohomology of . The cohomological dimension of is obtained as a corollary. Also, the braiding~ is proved to commute with the classical crystal reflection operators~.
Keywords
Cite
@article{arxiv.1612.05768,
title = {Plactic monoids: a braided approach},
author = {Victoria Lebed},
journal= {arXiv preprint arXiv:1612.05768},
year = {2016}
}