Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.11434

Chain projection ordered categories and DRC-restriction semigroups

Yin Die·Shoufeng Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we provide a theory of chain projection ordered categories and generalize that of chain projection ordered groupoids developed by East and Azeef Muhammed recently. By using chain projection ordered categories, we obtain a structure theorem for DRC-restriction semigroups. More specifically, we prove that the category of DRC-restriction semigroups together with (2,1,1)-homomorphisms is isomorphic to the category of chain projection ordered categories together with chain projection ordered functors. Moreover, some special cases are also considered. As applications of the main theorem, we demonstrate that the existence of free projection-generated DRC-restriction semigroups associated to any strong two-sided projection algebra and reobtain the structures of projection-fundamental DRC-restriction semigroups. Our work may be regarded as an answer for the fourth problem proposed by East and Azeef Muhammed in [Advances in Mathematics, 437 (2024) 109447].

Explore related subjects

math.GRmath.CT

Keep this discovery

BibTeXRIS

Yin Die, Shoufeng Wang. 2024-07-16. Chain projection ordered categories and DRC-restriction semigroups. https://arxiv.org/abs/2407.11434

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↗