SearcharxivSearch

arXiv · 1604.03465

On the congruence subgroup property for GGS-groups

Abstract

We show that all GGS-groups with non-constant defining vector satisfy the congruence subgroup property. This provides, for every odd prime $p$, many examples of finitely generated, residually finite, non-torsion groups whose profinite completion is a pro-$p$ group, and among them we find torsion-free groups. This answers a question of Barnea. On the other hand, we prove that the GGS-group with constant defining vector has an infinite congruence kernel and is not a branch group.

Explore related subjects

Keep this discovery

BibTeXRIS

Gustavo A. Fernández-Alcober, Alejandra Garrido, Jone Uria-Albizuri. 2016-04-12. On the congruence subgroup property for GGS-groups. https://doi.org/10.1090/proc/13499

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