Affiliation:
1. Fakultät für Mathematik Universität Bielefeld Bielefeld Germany
Abstract
AbstractWe construct finitely generated Engel branch groups, answering a question of Fernández‐Alcober, Noce and Tracey on the existence of such objects. In particular, the groups constructed are not nilpotent, yielding the second known class of examples of finitely generated non‐nilpotent Engel groups following a construction by Golod from 1969. To do so, we exhibit groups acting on rooted trees with growing valency on which word lengths of elements are contracting very quickly under section maps. Our methods apply in principle to a wider class of iterated identities, of which the Engel words are a special case.
Reference24 articles.
1. GROUP LAWS AND FREE SUBGROUPS IN TOPOLOGICAL GROUPS
2. Algorithmic Decidability of Engel’s Property for Automaton Groups
3. V. V.Bludov An example of not Engel group generated by Engel elements A Conference in Honor of Adalbert Bovdi's 70th Birthday (Debrecen Hungary) November 2005 pp.7–8.
4. Iterated identities and iterational depth of groups