English

Minimum transformation representations of diagram monoids

Rings and Algebras 2026-02-17 v3 Combinatorics

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 PnP_n has degree 1+B(n+2)B(n+1)+B(n)21 + \frac{B(n+2)-B(n+1)+B(n)}2 for n2n\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.

Keywords

Cite

@article{arxiv.2411.14693,
  title  = {Minimum transformation representations of diagram monoids},
  author = {Reinis Cirpons and James East and James D. Mitchell},
  journal= {arXiv preprint arXiv:2411.14693},
  year   = {2026}
}

Comments

V3: 35 pages, to appear in IMRN. V2 (submitted version): 36 pages, expanded intro. V1: 35 pages, 4 figures, 2 tables

R2 v1 2026-06-28T20:08:38.420Z