The Diophantine problem in finitely generated commutative rings
Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov

TL;DR
This paper investigates the decidability of polynomial equations in finitely generated commutative rings, showing that in many cases the problem is undecidable, and relating it to longstanding conjectures about algebraic integers.
Contribution
It establishes interpretations of rings of integers within finitely generated rings, linking Diophantine problems and undecidability to broader algebraic structures.
Findings
Diophantine problem in rings of positive characteristic is undecidable.
Interpretation of rings of integers within finitely generated rings.
Connection to the conjecture that $ ext{Z}$ is interpretable in rings of algebraic integers.
Abstract
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring we obtain an interpretation by systems of equations of a ring of integers of a finite field extension of either or , for some prime and variable . This implies that the Diophantine problem (decidability of systems of polynomial equations) in is reducible to the same problem in . If, in particular, has positive characteristic or, more generally, if has infinite rank, then we further obtain an interpretation by systems of equations of the ring in . This implies that the Diophantine problem in is undecidable in this case. In the remaining case where has finite rank and zero characteristic, we see that is a ring of algebraic integers, and then 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.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Commutative Algebra and Its Applications · Geometric and Algebraic Topology
