SearcharxivSearch

arXiv · 2607.26644

Automorphism-invariant refinements of weakly branch actions via overlap functions

Abstract

Let a finitely generated group $G$ act weakly branch on a locally finite rooted tree $T$ with boundary $\partial T$. The rooted tree structure is encoded by the \textit{overlap function}, which is our name for the Gromov product on the boundary: \[ c(\xi,\eta)=|\xi\wedge\eta|. \] We axiomatise this function and show that when it is `admissible', one can recover the rooted tree. By the boundary rigidity theorem of Lavreniuk and Nekrashevych, $\operatorname{Aut}(G)$ acts canonically on $\partial T$. We therefore form the automorphism symmetrisation of the overlap function: \[ \widehat c(\xi,\eta) =\inf_{\alpha\in\operatorname{Aut}(G)}c(\alpha \cdot\xi,\alpha \cdot\eta). \] We prove that $ \widehat c $ is again an admissible $G$-invariant overlap function and that its associated tree $ \widehat T $ is locally finite. The action of $G$ on $ \widehat T $ is faithful and weakly branch, and is branch if and only if the original action on $T$ is branch. Moreover, \[ N_{\operatorname{Aut}(\widehat T)}(G) \cong \operatorname{Aut}(G). \] In particular, $ \operatorname{Aut}(G) $ is weakly branch. We also describe the finite weakly branch extensions of $ G $: they are precisely the pullbacks of finite subgroups of $ \operatorname{Out}(G) $. If $ G $ is branch, all these extensions are branch. In both cases, they act on the same tree $ \widehat T $.

Explore related subjects

Keep this discovery

BibTeXRIS

Armando Martino. 2026-07-29. Automorphism-invariant refinements of weakly branch actions via overlap functions. https://arxiv.org/abs/2607.26644

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