Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.08218

The congruence subgroup problem for a family of branch groups

Rachel Skipper
View original source ↗Read source document ↗Export metadata ↓

Abstract

We construct a family of groups which generalize the Hanoi towers group and study the congruence subgroup problem for the groups in this family. We show that unlike the Hanoi towers group, the groups in this generalization are just infinite and have trivial rigid kernel. We also put strict bounds on the branch kernel. Additionally, we show that these groups have subgroups of finite index with non-trivial rigid kernel. The only previously known group where this kernel is non-trivial is the Hanoi towers group and so this adds infinitely many new examples. Finally, we show that the topological closures of these groups have Hausdorff dimension arbitrarily close to 1.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Rachel Skipper. 2017-09-24. The congruence subgroup problem for a family of branch groups. https://arxiv.org/abs/1709.08218

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↗