SearcharxivSearch

arXiv · 2303.09815

On conditions for the approximability of the fundamental groups of graphs of groups by root classes of groups

Abstract

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and is closed under taking subgroups, extensions, and Cartesian powers of a certain type). It is known that $\mathfrak{G}$ is residually a $\mathcal{C}$-group if it has a homomorphism onto a group from $\mathcal{C}$ acting injectively on all vertex groups. We prove that, in this assertion, the words "vertex groups" can be replaced by "edge subgroups" provided all vertex groups are residually $\mathcal{C}$-groups. We also show that the converse doesn't need to hold if $\mathcal{C}$ consists of periodic groups and contains at least one infinite group.

Explore related subjects

Keep this discovery

BibTeXRIS

E. V. Sokolov. 2023-03-17. On conditions for the approximability of the fundamental groups of graphs of groups by root classes of groups. https://arxiv.org/abs/2303.09815

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