Ranks of ideals in inverse semigroups of difunctional binary relations

James East; Alexei Vernitski

Home/Archive/arXiv

arXiv · 1612.04935

Ranks of ideals in inverse semigroups of difunctional binary relations

James East·Alexei Vernitski

View original source ↗Read source document ↗Export metadata ↓

Abstract

The set D_n of all difunctional relations on an n element set is an inverse semigroup under a variation of the usual composition operation. We solve an open problem of Kudryavtseva and Maltcev (2011), which asks: What is the rank (smallest size of a generating set) of D_n? Specifically, we show that the rank of D_n is B(n)+n, where B(n) is the nth Bell number. We also give the rank of an arbitrary ideal of D_n. Although D_n bears many similarities with families such as the full transformation semigroups and symmetric inverse semigroups (all contain the symmetric group and have a chain of J-classes), we note that the fast growth of rank(D_n) as a function of n is a property not shared with these other families.

Explore related subjects

math.GR math.CO math.RA

Keep this discovery

BibTeX RIS

James East, Alexei Vernitski. 2016-12-15. Ranks of ideals in inverse semigroups of difunctional binary relations. https://arxiv.org/abs/1612.04935

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↗