Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.08666

Twisted Brauer monoids

Igor Dolinka·James East
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the structure of the twisted Brauer monoid $\mathcal B_n^\tau$, comparing and contrasting it to the structure of the (untwisted) Brauer monoid $\mathcal B_n$. We characterise Green's relations and pre-orders on $\mathcal B_n^\tau$, describe the lattice of ideals, and give necessary and sufficient conditions for an ideal to be idempotent-generated. We obtain formulae for the rank (smallest size of a generating set) and (where applicable) the idempotent rank (smallest size of an idempotent generating set) of each principal ideal; in particular, when an ideal is idempotent-generated, its rank and idempotent rank are equal. As an application of our results, we also describe the idempotent-generated subsemigroup of $\mathcal B_n^\tau$ (which is not an ideal) as well as the singular ideal of $\mathcal B_n^\tau$ (which is neither principal nor idempotent-generated), and we deduce a result of Maltcev and Mazorchuk that the singular part of the Brauer monoid $\mathcal B_n$ is idempotent-generated.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Igor Dolinka, James East. 2015-10-29. Twisted Brauer monoids. https://arxiv.org/abs/1510.08666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗