论文信息 - Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity

Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity

A natural interpretation of automorphisms of one-rooted trees as output automata permits the application of notions of growth and circuit structure in their study. New classes of groups are introduced corresponding to diverse growth functions and circuit structure. In the context of automorphisms of the binary tree, we discuss the structure of maximal 2-subgroups and the question of existence of free subgroups. Moreover, we construct Burnside 2-groups generated by automorphisms of the binary tree which are finite state, bounded, and acyclic.

Said Sidki | S. Sidki

[1] P. Zalesskii,et al. Conjugacy separability of certain torsion groups , 1997 .

[2] R. Grigorchuk,et al. Bernside's problem on periodic groups , 1980 .

[3] D. Passman,et al. Representations of the Gupta-Sidki group , 1996 .

[4] Said Sidki,et al. The Generation of GL(n, Z) by Finite State Automata , 1998, Int. J. Algebra Comput..

[5] A. C. Vieira. On the lower central series and the derived series of the gupta-sidki 3-group , 1998 .

[6] S. Sidki. A Primitive Ring Associated to a Burnside 3‐Group , 1997 .

[7] Groups St Andrews 1997 in Bath, I: On the system of defining relations and the Schur multiplier of periodic groups generated by finite automata , 1999 .

[8] M. Rubin. The Reconstruction of Trees from Their Automorphism Groups , 1993 .

[9] Said Sidki,et al. On the Automorphism Group of the One-Rooted Binary Tree , 1997 .

[10] Hyman Bass,et al. Cyclic Renormalization and Automorphism Groups of Rooted Trees , 1995 .

[11] WREATH PRODUCTS AND PERIODIC FACTORABLE GROUPS , 1990 .

[12] Narain Gupta,et al. On the Burnside problem for periodic groups , 1983 .

[13] M. Bhattacharjee,et al. The Ubiquity of Free Subgroups in Certain Inverse Limits of Groups , 1995 .

[14] S. Sidki,et al. A just-nonsolvable torsion-free group defined on the binary tree , 1999 .