2000 character limit reached
Tensor powers of representations of (diagram) monoids
Published 6 Aug 2025 in math.RT, math.CT, and math.GR | (2508.04054v1)
Abstract: We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb, Motzkin, and Brauer monoids. For these examples, we compute explicit data, including some character tables, and analyze patterns in the decomposition of their tensor powers.
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.