SearcharxivSearch

arXiv · 2109.13389

Braiding groups of automorphisms and almost-automorphisms of trees

Abstract

We introduce "braided" versions of self-similar groups and R\"over--Nekrashevych groups, and study their finiteness properties. This generalizes work of Aroca and Cumplido, and the first author and Wu, who considered the case when the self-similar groups are what we call "self-identical". In particular we use a braided version of the Grigorchuk group to construct a new group called the braided R\"over group, which we prove is of type $F_\infty$. Our techniques involve using so called $d$-ary cloning systems to construct the groups, and analyzing certain complexes of embedded disks in a surface to understand their finiteness properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Rachel Skipper, Matthew C. B. Zaremsky. 2021-09-27. Braiding groups of automorphisms and almost-automorphisms of trees. https://doi.org/10.4153/s0008414x23000159

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