Problems / logic-foundations
logic-foundations / Computability; Hilbert's tenth problem
Matiyasevich's single-fold conjecture: every r.e. set has a single-fold Diophantine representation
Theorem 1.1: every r.e. S⊆Nn, n≥1, has a polynomial P∈Z[A1..An,W1..Wm] with #{w∈Nm:P(a,w)=0} equal to 1 for a∈S and 0 otherwise. Hence the finite-fold conjecture holds, and Diophantine solvability over N stays undecidable under an at-most-one-solution promise (Section 8). The construction bounds a Pell-type exponential with a cutoff from rational points on a rank-one elliptic curve. Witnesses range over N; the paper does not claim the analogue over Z beyond what follows from it, nor any bound on degree or number of variables.