SearcharxivSearch

arXiv · 1602.03575

Automorphism Groups of Trees: Generalities and Prescribed Local Actions

Abstract

This article is an expanded version of the talks given by the authors at the Arbeitsgemeinschaft "Totally Disconnected Groups", held at Oberwolfach in October 2014. We recall the basic theory of automorphisms of trees and Tits' simplicity theorem, and present two constructions of tree groups via local actions with their basic properties: the universal group associated to a finite permutation group by M. Burger and S. Mozes, and the $k$-closures of a given group by C. Banks, M. Elder and G. Willis.

Explore related subjects

Keep this discovery

BibTeXRIS

Alejandra Garrido, Yair Glasner, Stephan Tornier. 2016-02-10. Automorphism Groups of Trees: Generalities and Prescribed Local Actions. https://arxiv.org/abs/1602.03575

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