Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0
Laurent Moret-Bailly, Alexandra Shlapentokh

TL;DR
This paper proves that Hilbert's Tenth Problem is undecidable for certain holomorphy rings of function fields of characteristic zero, extending undecidability results to a broad class of algebraic structures.
Contribution
It establishes the undecidability of Hilbert's Tenth Problem for holomorphy rings of function fields in characteristic zero, generalizing previous results in number theory and algebraic geometry.
Findings
Hilbert's Tenth Problem is undecidable in these rings
Existence of specific elements in R with no algorithmic solution
Undecidability holds under recursive conditions on K
Abstract
Let be a one-variable function field over a field of constants of characteristic 0. Let be a holomorphy subring of , not equal to . We prove the following undecidability results for : If is recursive, then Hilbert's Tenth Problem is undecidable in . In general, there exist such that there is no algorithm to tell whether a polynomial equation with coefficients in has solutions in .
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
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Advanced Differential Equations and Dynamical Systems
