Minimum transformation representations of diagram monoids
Reinis Cirpons, James East, James D. Mitchell

TL;DR
This paper derives explicit formulas for the minimum transformation degrees of key finite diagram monoids, providing new insights into their algebraic representations and explicit faithful models.
Contribution
It introduces formulas for the minimum transformation degrees of various diagram monoids, including partition, Brauer, Temperley–Lieb, and Motzkin monoids, with explicit constructions.
Findings
Partition monoid degree formula involving Bell numbers
Explicit faithful representations constructed for these monoids
Results applicable to understanding algebraic actions on projections
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 has degree for , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · semigroups and automata theory
