# A just-nonsolvable torsion-free group defined on the binary tree

@article{Brunner1999AJT, title={A just-nonsolvable torsion-free group defined on the binary tree}, author={A. M. Brunner and Said Najati Sidki and Ana Cristina Vieira}, journal={Journal of Algebra}, year={1999}, volume={211}, pages={99-114} }

Abstract A two-generator torsion-free subgroup of the group of finite-state automorphisms of the binary tree is constructed having the properties of being just-nonsolvable and residually “torsion-free solvable.” A presentation is produced for this subgroup in two generators and two relations together with their images under the iterated application of a certain simple substitution.

## 50 Citations

The Binary Adding Machine and Solvable Groups

- MathematicsInt. J. Algebra Comput.
- 2003

We prove that any solvable subgroup K of automorphisms of the binary tree, which contains the binary adding machine is an extension of a torsion-free metabelian group by a finite 2-group. If the…

Finite Automata of Polynomial Growth do Not Generate A Free Group

- Mathematics
- 2004

A free subgroup of rank 2 of the automorphism group of a regular rooted tree of finite degree cannot be generated by finite-state automorphisms having polynomial growth. This result is in fact proven…

On a Torsion-Free Weakly Branch Group Defined by a Three State Automaton

- MathematicsInt. J. Algebra Comput.
- 2002

We study a torsion free weakly branch group G without free subgroups defined by a three state automaton which appears in different problems related to amenability, Galois groups and monodromy. Here...

Rigidity of Branch Groups Acting on Rooted Trees

- Mathematics
- 2002

Automorphisms of groups acting faithfully on rooted trees are studied. We find conditions under which every automorphism of such a group is induced by a conjugation from the full automorphism group…

Approximating the Schur multiplier of certain infinitely presented groups via nilpotent quotients

- Mathematics
- 2010

We describe an algorithm for computing successive quotients of the Schur multiplier M ( G ) of a group G given by an invariant finite L -presentation. As applications, we investigate the Schur…

Just Non-(abelian by P -type) Groups

- Mathematics
- 2005

A group K is of P-type provided it is isomorphic to a subgroup of a finitely iterated wreath product of copies of P. For any group P, define a rooted regular tree T(P) on which P acts permuting…

Galois coverings of Schreier graphs of groups generated by bounded automata

- Mathematics
- 2017

We give a characterization of the covering Schreier graphs of groups generated by bounded automata to be Galois. We also investigate the zeta and $L$ functions of Schreier graphs of few groups namely…

On amenability of automata groups

- Mathematics
- 2010

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on…

On a group associated to $z^2-1$

- Mathematics
- 2002

We construct a group acting on a binary rooted tree; this discrete group mimics the monodromy action of iterates of $f(z)=z^2-1$ on associated coverings of the Riemann sphere.
We then derive some…

## References

SHOWING 1-10 OF 11 REFERENCES

The Generation of GL(n, Z) by Finite State Automata

- MathematicsInt. J. Algebra Comput.
- 1998

Finite state automata are constructed which show that GL(n, Z) is embeddable in the group of finite state automorphisms of the one-rooted regular tree of valency 2n.

Degrees of Growth of Finitely Generated Groups, and the Theory of Invariant Means

- Mathematics
- 1985

This paper gives a negative solution to the problem of Milnor concerning the degrees of growth of groups. The construction also answers a question of Day concerning amenable groups. A number of other…

Finite automata and Burnside's problem for periodic groups

- Mathematics
- 1972

New examples of infinite periodic finitely-generated groups are constructed. The elements of the groups are mappings of a set of words in an alphabet X into itself induced by finite Mealy automata.…

Conjugacy separability of certain torsion groups

- Mathematics
- 1997

Abstract. It is shown that certain torsion groups studied by Grigorchuk and by Gupta and Sidki are conjugacy separable.

Cyclic Renormalization and Automorphism Groups of Rooted Trees

- Mathematics
- 1995

Cyclic renormalization.- Itinerary calculus and renormalization.- Spherically transitive automorphisms of rooted trees.- Closed normal subgroups of Aut(X(q)).

On the Burnside problem for periodic groups

- Mathematics
- 1983

Narain Gupta 1,. and Said Sidki 2 1 University of Manitoba, Department of Mathematics, Winnipeg, Manitoba R3T 2N2, Canada 2 University of Brasilia, Department of Mathematics, Brasilia, D.F., Brazil…