"An Automaton Group with Undecidable Order and Engel Problems";
angenommen für Journal of Algebra
For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and only if, this element is of finite order.
If the Turing machine is universal, the corresponding automaton group has an undecidable order problem. This solves a problem raised by Grigorchuk.
The above group also has an undecidable Engel problem: there is no algorithm that, given g, h in the group, decides whether there exists an integer n such that the n-iterated commutator [...[[g,h],h],...,h] is the identity or not. This solves a problem raised by Bartholdi.
Erstellt aus der Publikationsdatenbank der Technischen Universitšt Wien.