2000 character limit reached
Transformation representations of diagram monoids
Published 22 Nov 2024 in math.RA and math.CO | (2411.14693v1)
Abstract: We obtain formulae for the minimum transformation degrees of the most well-studied families of finite diagram monoids, including the partition, Brauer, Temperley--Lieb and Motzkin monoids. For example, the partition monoid $\mathcal P_n$ has degree $1 + \frac{B(n+2)-B(n+1)+B(n)}2$ for $n\geq2$, where these are Bell numbers. The proofs involve constructing explicit faithful representations of the minimum degree, many of which can be realised as (partial) actions on projections.
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.