SearcharxivSearch

arXiv · 0902.3220

The congruence subgroup problem for branch groups

Abstract

We state and study the congruence subgroup problem for groups acting on rooted tree, and for branch groups in particular. The problem is reduced to the computation of the congruence kernel, which we split into two parts: the branch kernel and the rigid kernel. In the case of regular branch groups, we prove that the first one is Abelian while the second has finite exponent. We also establish some rigidity results concerning these kernels. We work out explicitly known and new examples of non-trivial congruence kernels, describing in each case the group action. The Hanoi tower group receives particular attention due to its surprisingly rich behaviour.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laurent Bartholdi, Olivier Siegenthaler, Pavel Zalesskii. 2009-02-18. The congruence subgroup problem for branch groups. https://doi.org/10.1007/s11856-011-0086-5

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