A just-nonsolvable torsion-free group defined on the binary tree
From MaRDI portal
Publication:1279814
DOI10.1006/jabr.1998.7579zbMath0920.20029OpenAlexW2089972498MaRDI QIDQ1279814
Publication date: 12 July 1999
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1998.7579
residually finite groupsrecursive presentationssolvable conjugacy problemautomorphism groups of one-rooted treesjust-non-solvable torsion free groups
Generators, relations, and presentations of groups (20F05) Generalizations of solvable and nilpotent groups (20F19) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Automorphism groups of groups (20F28) Residual properties and generalizations; residually finite groups (20E26)
Related Items
ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON, Unnamed Item, The true prosoluble completion of a group: examples and open problems., On amenability of automata groups., \(p\)-Basilica groups, Endomorphic presentations of branch groups., Branch rings, thinned rings, tree enveloping rings., Finite automata of polynomial growth do not generate a free group., THE BINARY ADDING MACHINE AND SOLVABLE GROUPS, A NILPOTENT QUOTIENT ALGORITHM FOR CERTAIN INFINITELY PRESENTED GROUPS AND ITS APPLICATIONS, Engel elements in some fractal groups, Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity., RESTRICTED LIE ALGEBRAS OF POLYCYCLIC GROUPS, SELF-SIMILAR INVERSE SEMIGROUPS AND SMALE SPACES, Wreath operations in the group of automorphisms of the binary tree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Burnside problem for periodic groups
- On Burnside's problem on periodic groups
- A system of defining relations for a Grigorchuk group
- On a 2-generated infinite 3-group: The presentation problem
- Conjugacy separability of certain torsion groups
- On the automorphism group of the one-rooted binary tree
- Cyclic renormalization and automorphism groups of rooted trees
- Finite automata and Burnside's problem for periodic groups
- 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