A just-nonsolvable torsion-free group defined on the binary tree (Q1279814)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A just-nonsolvable torsion-free group defined on the binary tree |
scientific article |
Statements
A just-nonsolvable torsion-free group defined on the binary tree (English)
0 references
12 July 1999
0 references
A fascinating example of a 2-generated residually finite torsion free just-non-solvable group is constructed (just-non-solvable means that every proper quotient is solvable). The group is a subgroup of the group of finite state automorphisms of the rooted binary tree and its construction is along the lines of the famous Grigorchuk and Gupta-Sidki constructions of residually finite torsion groups. The group constructed in the paper enjoys other residual properties: it is residually a 2-group, residually a torsion free solvable group. The fact that the conjugacy problem is solvable for this group is proved. The group admits a very simple recursive presentation in two generators and two relations which are iterated under a certain simple substitution. In the final comments the question about the growth function of this group is raised.
0 references
residually finite groups
0 references
automorphism groups of one-rooted trees
0 references
just-non-solvable torsion free groups
0 references
solvable conjugacy problem
0 references
recursive presentations
0 references