Search arXivSearch

arXiv · 2305.08064

Ehresmann-Schein-Nambooripad theorems for classes of biunary semigroups

Abstract

We obtain an ESN theorem for a very general class of biunary semigroups with idempotent-valued domain and range operations, representing them in terms of small categories equipped with a suitable biaction of the identities on the category. Our results generalise the recent work of Fitzgerald and Kinyon connecting localisable semigroups to transcription categories, as well as that of Lawson linking Ehresmann semigroups to categories with Ehresmann biaction. In contrast to most approaches to ESN theorems, we do not require the categories to be ordered or for their sets of identities to possess any particular structure. Throughout, the biunary semigroups are represented using categories rather than generalised categories of any kind, and we obtain category isomorphisms between the clesses of semigroups and their associated enriched categories, rather than category equivalences. Our results cover the class of DRC-semigroups considered by Jones and Shoufeng Wang, but they also cover cases where not both congruence conditions hold, including examples such as the semigroup of binary relations on a set under demonic composition equipped with domain and range operations.

Explore related subjects

Keep this discovery

BibTeXRIS

Tim Stokes. 2023-05-14. Ehresmann-Schein-Nambooripad theorems for classes of biunary semigroups. https://arxiv.org/abs/2305.08064

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

KEEP EXPLORING

Related papers

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

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

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