SearcharxivSearch

arXiv · 2309.03030

Auxiliary free constructions for explicit embeddings of recursive groups

Abstract

An auxiliary free construction $*_{i=1}^{r}(K_i, L_i, t_i)_M$ based on HNN-extensions and on generalized free product of groups with amalgamated subgroups is suggested, and some of its basic properties are displayed. The proposed construction is a generalization of a series of structures used by Higman for embeddings of recursive groups into finitely presented groups, and also for certain structures we recently applied in the research on embeddings of recursive groups. Usage of this technical tool substantially simplifies some embedding methods for recursive groups. A few technical results on specific subgroups in the suggested $*$-constructions, in the HNN-extensions of groups, and in free products of groups with amalgamated subgroup are proved. The obtained properties are applied to build infinitely generated benign subgroups inside free groups of small rank.

Explore related subjects

Keep this discovery

BibTeXRIS

Vahagn H. Mikaelian. 2023-09-06. Auxiliary free constructions for explicit embeddings of recursive groups. https://arxiv.org/abs/2309.03030

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