Undecidability conjecture for Diophantine problems over number fields and rings of algebraic integers
Undecidability conjecture for Diophantine problems over number fields and rings of algebraic integers
Let be a number field, meaning a finite algebraic extension of , and let be a ring of algebraic integers. The Diophantine problem asks whether polynomial equations with coefficients in the given ring or field have solutions in that structure. Undecidability conjecture. The Diophantine problem in , as well as in any number field , or any ring of algebraic integers , is undecidable. This extends the classical undecidability of the Diophantine problem in and is a major conjecture in number theory; its status is not resolved in the supplied text.
Sources & referencesView supporting material
Primary source
Elena Bunina, Alexey Miasnikov and Eugene Plotkin, “The Diophantine problem in Chevalley groups”, arXiv:2304.06259 (2023).
Additional references
2 papers in this index state this conjecture (2016–2023). The statement above is taken from the most recent of them; the others are arXiv:1606.03617.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.