Search arXivSearch

arXiv · math/0308127

The Automorphism Tower of Groups acting on Rooted Trees

Abstract

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such well-known examples as the group G studied by R. Grigorchuk, and the group H studied by N. Gupta and the second author. In this paper, we pursue the larger theme of towers of automorphisms of groups of tree isometries such as G and H. We describe this tower for all groups acting on the binary rooted tree which decompose as infinitely iterated wreath products. Furthermore, we describe fully the towers of G and H. More precisely, the tower of G is infinite countable, and the terms of the tower are 2-groups. Quotients of successive terms are infinite elementary abelian 2-groups. In contrast, the tower of H has length 2, and its terms are {2,3}-groups. We show that the quotient aut^2(H)/aut(H) is an elementary abelian 3-group of countably infinite rank, while aut^3(H)=aut^2(H).

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Bartholdi, Said N. Sidki. 2003-08-13. The Automorphism Tower of Groups acting on Rooted Trees. https://doi.org/10.1090/s0002-9947-05-03712-8

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