SearcharxivSearch

arXiv · 2007.06867

Pro-p groups acting on trees with finitely many maximal vertex stabilizers up to conjugation

Abstract

We prove that a finitely generated pro-$p$ group $G$ acting on a pro-$p$ tree $T$ splits as a free amalgamated pro-$p$ product or a pro-$p$ HNN-extension over an edge stabilizer. If $G$ acts with finitely many vertex stabilizers up to conjugation we show that it is the fundamental pro-$p$ group of a finite graph of pro-$p$ groups $(\cal G, \Gamma)$ with edge and vertex groups being stabilizers of certain vertices and edges of $T$ respectively. If edge stabilizers are procyclic, we give a bound on $\Gamma$ in terms of the minimal number of generators of $G$. We also give a criterion for a pro-$p$ group $G$ to be accessible in terms of the first cohomology $H^1(G, \mathbb{F}_p[[G]])$.

Explore related subjects

Keep this discovery

BibTeXRIS

Zoé Chatzidakis, Pavel Zalesskii. 2020-07-14. Pro-p groups acting on trees with finitely many maximal vertex stabilizers up to conjugation. https://arxiv.org/abs/2007.06867

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