Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 17 tok/s
GPT-5 High 14 tok/s Pro
GPT-4o 97 tok/s
GPT OSS 120B 455 tok/s Pro
Kimi K2 194 tok/s Pro
2000 character limit reached

Plactic monoids: a braided approach (1612.05768v1)

Published 17 Dec 2016 in math.CO, math.KT, and math.RA

Abstract: Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid $\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 $\sigma$ on the (much simpler!) set of columns $\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 $\mathbf{Pl}$, which resists classical approaches, with the more accessible braided cohomology of $(\mathbf{Col},\sigma)$. The cohomological dimension of $\mathbf{Pl}$ is obtained as a corollary. Also, the braiding~$\sigma$ is proved to commute with the classical crystal reflection operators~$s_i$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)