Wreath operations in the group of automorphisms of the binary tree

DOI10.1016/S0021-8693(02)00050-9zbMath1027.20018OpenAlexW2047531200MaRDI QIDQ1858243

Yanyan Li

Publication date: 12 February 2003

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-8693(02)00050-9

zbMATH Keywords

wreath productsautomorphism groupspro-\(p\) groupsfaithful representationsrooted binary treesfinite state automatafree metabelian groupsfinite state automorphisms

Mathematics Subject Classification ID

Trees (05C05) Automorphisms of infinite groups (20E36) Extensions, wreath products, and other compositions of groups (20E22) Automorphism groups of groups (20F28) Groups acting on trees (20E08)

Related Items (4)

Intransitive self-similar groups ⋮ Finite automata of polynomial growth do not generate a free group. ⋮ THE BINARY ADDING MACHINE AND SOLVABLE GROUPS ⋮ TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A just-nonsolvable torsion-free group defined on the binary tree
• On the automorphism group of the one-rooted binary tree
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Residual Properties of Infinite Soluble Groups
• The Generation of GL(n, Z) by Finite State Automata
• Finiteness Conditions for Soluble Groups

This page was built for publication: Wreath operations in the group of automorphisms of the binary tree