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

DOI10.1007/BF02677504zbMath1069.20504MaRDI QIDQ1580386

N. Delaunay

Publication date: 14 September 2000

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

free subgroups; growth functions; maximal 2-subgroups; automorphisms of binary trees; Burnside 2-groups; output automata

Mathematics Subject Classification ID

05C05: Trees

68Q45: Formal languages and automata

20E07: Subgroup theorems; subgroup growth

20F50: Periodic groups; locally finite groups

20F05: Generators, relations, and presentations of groups

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

20E36: Automorphisms of infinite groups

20E08: Groups acting on trees

Cites Work

• Unnamed Item
• A free group of finite automata
• On Burnside's problem on periodic groups
• A just-nonsolvable torsion-free group defined on the binary tree
• Conjugacy separability of certain torsion groups
• On the automorphism group of the one-rooted binary tree
• Lower central series of a group of tree automorphisms
• The ubiquity of free subgroups in certain inverse limits of groups
• Cyclic renormalization and automorphism groups of rooted trees
• WREATH PRODUCTS AND PERIODIC FACTORABLE GROUPS
• The Reconstruction of Trees from Their Automorphism Groups
• A Primitive Ring Associated to a Burnside 3-Group
• The Generation of GL(n, Z) by Finite State Automata
• On the lower central series and the derived series of the gupta-sidki 3-group
• Representations of the Gupta-Sidki group