Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.05739

Amalgamating inverse semigroups over ample semigroups

Nasir Sohail
View original source ↗Read source document ↗Export metadata ↓

Abstract

A semigroup amalgam (S; T1, T2) is known to be non-embeddable if T1 and T2 are both groups (completely regular semigroups, Clifford semigroups) but S is not such. We prove some non-embeddability conditions for semigroup amalgams (S; T1, T2) in which T1 and T2 are inverse semigroups but S is not such. We also introduce some sufficient conditions that make the inverse hulls of the copies of S in T1 and T2 isomorphic; making, in turn, the amalgam (S; T1, T2) weakly embeddable.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Nasir Sohail. 2024-06-09. Amalgamating inverse semigroups over ample semigroups. https://arxiv.org/abs/2406.05739

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↗