Diophantine problems in solvable groups
Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov

TL;DR
This paper investigates the decidability of solving systems of equations in various finitely generated solvable groups, linking it to the undecidability of similar problems in rings of algebraic integers, and establishing undecidability in several specific groups.
Contribution
It proves that the Diophantine problem in many solvable groups can be reduced to that in rings of algebraic integers, and identifies cases where this problem is undecidable.
Findings
Diophantine problem in certain groups is reducible to that in rings of algebraic integers.
In many groups, the ring of integers is isomorphic to Z, making the problem undecidable.
Undecidability established for groups like $GL(3,bZ)$, $SL(3,bZ)$, and $T(3,bZ)$.
Abstract
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural "non-commutativity" conditions. For each group in one of these classes, we prove that there exists a ring of algebraic integers that is interpretable in by finite systems of equations (e-interpretable), and hence that the Diophantine problem in is polynomial time reducible to the Diophantine problem in . One of the major open conjectures in number theory states that the Diophantine problem in any such is undecidable. If true this would imply that the Diophantine problem in any such is also undecidable. Furthermore, we show that for many particular groups as above, the ring is isomorphic to the ring of integers , so the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
