Wreath operations in the group of automorphisms of the binary tree

DOI10.1016/S0021-8693(02)00050-9MaRDI QIDQ1858243zbMATH OpenOpenAlexFDO

Authors 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

faithful representationswreath productsautomorphism groupsfinite state automatarooted binary treespro-\(p\) groupsfree metabelian groupsfinite state automorphisms

Mathematics Subject Classification ID

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

Recommendations

• TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA
• Representation of wreath powers of a finite group in the automorphism group of a rooted tree.
• On the automorphism group of the one-rooted binary tree
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.
• scientific article; zbMATH DE number 2152960

Cites work

• scientific article; zbMATH DE number 3875506 (Why is no real title available?)
• scientific article; zbMATH DE number 2152960 (Why is no real title available?)
• A just-nonsolvable torsion-free group defined on the binary tree
• Automata, dynamical systems, and groups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Finiteness Conditions for Soluble Groups
• On the automorphism group of the one-rooted binary tree
• Residual Properties of Infinite Soluble Groups
• The Generation of GL(n, Z) by Finite State Automata

Cited in

(8)

• Intransitive self-similar groups
• Representation of wreath powers of a finite group in the automorphism group of a rooted tree.
• The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set.
• TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA
• Finite automata of polynomial growth do not generate a free group.
• On state-closed representations of restricted wreath product of groups \(G_{p,d}=C_{p}wrC^{d}\)
• Endomorphisms of the finitary group of isometries of the binary tree.
• THE BINARY ADDING MACHINE AND SOLVABLE GROUPS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1858243)