Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.00912

Free factors and profinite completions

Alejandra Garrido·Andrei Jaikin-Zapirain
View original source ↗Read source document ↗Export metadata ↓

Abstract

Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only if its closure in the profinite completion of $G$ is a profinite free factor. This generalises results by Parzanchevski and Puder (later also proved by Wilton) for free groups. Our methods are entirely different to theirs, combining homological properties of profinite groups and the decomposition theory of Dicks and Dunwoody.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Alejandra Garrido, Andrei Jaikin-Zapirain. 2022-07-02. Free factors and profinite completions. https://doi.org/10.1093/imrn%2Frnac309

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↗