We prove that the Diophantine problem for quadratic equations in the Grigorchuk group is algorithmically solvable. As a corollary to our approach, we prove that the group has a finite commutator width.
机构:
A. S. Popov National Odessa Academy of Communication 1, Odessa 65000, Kuznechnaya Str.A. S. Popov National Odessa Academy of Communication 1, Odessa 65000, Kuznechnaya Str.