SearcharxivSearch

arXiv · 2308.12185

Profinite Subgroup Accessibility and Recognition of Amalgamated Factors

Abstract

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises as the kernel of a continuous derivation of $G$ in a free module over its completed group algebra. This allows us to deduce splittings of an abstract group from splittings of its profinite completion. We prove that any finitely generated subgroup $\Delta$ of a finitely generated virtually free group $\Gamma$ whose closure is a factor in a profinite amalgamated product $\widehat{\Gamma} = \overline{\Delta} \amalg_K L$ along a finite $K$ must be a factor in an amalgamated product $\Gamma = \Delta \ast_\chi \Lambda$ along some $\chi \cong K$. This extends previous results of Parzanchevski--Puder, Wilton and Garrido--Jaikin-Zapirain on free factors.

Explore related subjects

Keep this discovery

BibTeXRIS

Julian Wykowski. 2023-08-23. Profinite Subgroup Accessibility and Recognition of Amalgamated Factors. https://arxiv.org/abs/2308.12185

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