Plactic monoids: a braided approach

preprint2016arXivOpen access

Abstract

Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid Pl\mathbf{Pl}, 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 Col\mathbf{Col}. Here a \emph{braiding} is a set-theoretic solution to the Yang--Baxter equation. As an application, we identify the Hochschild cohomology of Pl\mathbf{Pl}, which resists classical approaches, with the more accessible braided cohomology of (Col,σ)(\mathbf{Col},σ). The cohomological dimension of Pl\mathbf{Pl} is obtained as a corollary. Also, the braiding~σσ is proved to commute with the classical crystal reflection operators~s_is\_i.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.