THE BINARY ADDING MACHINE AND SOLVABLE GROUPS

DOI10.1142/S0218196703001328zbMath1074.20017OpenAlexW2078259496MaRDI QIDQ3043632

No author found.

Publication date: 6 August 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196703001328

zbMATH Keywords

automorphism groupssolvable groupsbinary trees

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Extensions, wreath products, and other compositions of groups (20E22) Groups acting on trees (20E08) Infinite automorphism groups (20B27)

Cites Work

• Unnamed Item
• A just-nonsolvable torsion-free group defined on the binary tree
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Wreath operations in the group of automorphisms of the binary tree
• The Generation of GL(n, Z) by Finite State Automata

This page was built for publication: THE BINARY ADDING MACHINE AND SOLVABLE GROUPS