Minimum transformation representations of diagram monoids

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 Pn has degree 1 + B(n+2)-B(n+1)+B(n)2 for n≥2, 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…