Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1501.01227

Free subgroups of finitely generated free profinite groups

Mark Shusterman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated nonabelian free profinite group is contained in an infinitely generated free profinite subgroup. These results are combined with the twisted wreath product approach of Haran, an observation on the action of compact groups, and a rank counting argument to prove a conjecture of Bary-Soroker, Fehm, and Wiese, thus providing a quite general sufficient condition for subgroups to be free profinite. As a result of our work, we are able to address a conjecture of Jarden on the Hilbertianity of fields generated by torsion points of abelian varieties.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Mark Shusterman. 2015-01-06. Free subgroups of finitely generated free profinite groups. https://doi.org/10.1112/jlms%2Fjdw001

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↗