Minimum transformation representations of diagram monoids

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Cirpons, Reinis, East, James, Mitchell, James D.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915798874849280
author Cirpons, Reinis
East, James
Mitchell, James D.
author_facet Cirpons, Reinis
East, James
Mitchell, James D.
contents 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 $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.
format Preprint
id arxiv_https___arxiv_org_abs_2411_14693
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Minimum transformation representations of diagram monoids
Cirpons, Reinis
East, James
Mitchell, James D.
Rings and Algebras
Combinatorics
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 $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.
title Minimum transformation representations of diagram monoids
topic Rings and Algebras
Combinatorics
url https://arxiv.org/abs/2411.14693