The Automorphism Tower of Groups acting on Rooted Trees

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Minor corrections

Scientific paper

10.1090/S0002-9947-05-03712-8

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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Automorphism Tower of Groups acting on Rooted Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Automorphism Tower of Groups acting on Rooted Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Automorphism Tower of Groups acting on Rooted Trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-82557

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.