Search arXivSearch

arXiv · 2301.09078

Rigid stabilizers and local prosolubility for boundary-transitive actions on trees

Abstract

Let $G$ be a group acting $2$-transitively on the boundary of a locally finite tree, and exclude the situation (which is a genuine exception) where $G$ has both $\mathrm{P}\Gamma\mathrm{L}_3(4)$ and $\mathrm{P}\Gamma\mathrm{L}_3(5)$ as local actions. We show that for each half-tree $T_a$, the local action of the rigid stabilizer of $T_a$ at the root of $T_a$ contains the soluble residual of the point stabilizer of the local action of $G$. In particular, $G$ is locally prosoluble if and only if its local actions have soluble point stabilizers; if $G$ is not locally prosoluble, then it has micro-supported action on the boundary. We also prove some strong restrictions on the local actions of end stabilizers in $G$. These results are partly inspired by Radu's classification of groups acting boundary-$2$-transitively on trees with local action containing the alternating group, and partly based on the author's recent classification of finite permutation groups that preserve an equivalence relation, act faithfully on blocks and act transitively on pairs of points from different blocks.

Explore related subjects

Keep this discovery

BibTeXRIS

Colin D. Reid. 2023-01-22. Rigid stabilizers and local prosolubility for boundary-transitive actions on trees. https://arxiv.org/abs/2301.09078

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