Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 201-239 |
| Number of pages | 39 |
| Journal | Groups, Geometry, and Dynamics |
| Volume | 10 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2016 |
Keywords
- Diophantine problem
- Grigorchuck group
- Quadratic equations
Fingerprint
Dive into the research topics of 'Quadratic equations in the grigorchuk group'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver