Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0804.3205

Stability of Universal Equivalence of Groups under Free Constructions

A. J. Duncan·I. V. Kazachkov·V. N. Remeslennikov
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1971 J. Stallings introduced a generalisation of amalgamated products of groups -- called a pregroup, which is a particular kind of a partial group. He defined the universal group U(P) of a pregroup P to be a universal object (in the sense of category theory) extending the partial operations on P to group operations on U(P). This turns out to be a versatile and convenient generalisation of classical group constructions: HNN-extensions and amalgamated products. In this respect the following general question arises. Which properties of pregroups, or relations between pregroups, carry over to the respective universal groups? In this paper it is proved that universal equivalence of pregroups extends to universal equivalence of universal groups. Applications to free products with amalgamation and HNN-extensions are then described.

Explore related subjects

math.GRmath.LO

Keep this discovery

BibTeXRIS

A. J. Duncan, I. V. Kazachkov, V. N. Remeslennikov. 2008-04-20. Stability of Universal Equivalence of Groups under Free Constructions. https://arxiv.org/abs/0804.3205

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↗