Related papers: Hilbert's Tenth Problem and Mazur's Conjectures in…

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…

Let K be a p-adic field (a finite extension of some Q_p) and let K(t) be the field of rational functions over K. We define a kind of quadratic reciprocity symbol for polynomials over K and apply it to prove isotropy for a certain class of…

This paper explores undecidability in theories of positive characteristic function fields in the "geometric" language of rings $\mathcal{L}_F = \{0, 1, +, \cdot, F\}$, with a unary predicate $F$ for nonconstant elements. In particular we…

The recent negative answer to Hilbert's tenth problem over rings of integers relies on a theorem that for every extension of number fields $L/K$, if there is an abelian variety $A$ over $K$ such that $0 < \operatorname{rank} A(K) =…

Hilbert's Tenth Problem (H10) for a ring R asks for an algorithm to decide correctly, for each $f\in\mathbb{Z}[X_{1},\dots,X_{n}]$, whether the diophantine equation $f(X_{1},...,X_{n})=0$ has a solution in R. The celebrated…

One of the main open problems regarding decidability of the existential theory of rings is the analogue of Hilbert's Tenth Problem (HTP) for the ring of entire holomorphic functions in one variable. In the direction of a negative solution,…

In this article we outline the methods that are used to prove undecidability of Hilbert's Tenth Problem for function fields of characteristic zero. Following Denef we show how rank one elliptic curves can be used to prove undecidability for…

In this paper we investigate the 2-Selmer rank in families of quadratic twists of elliptic curves over arbitrary number fields. We give sufficient conditions on an elliptic curve so that it has twists of arbitrary 2-Selmer rank, and we give…

Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smory\'nski's theorem states that the set of all Diophantine equations which have at most…

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…

To prove that Hilbert's tenth problem over a ring R has a negative answer, usually the integers or another ring for which Hilbert's tenth problem has a negative solution is modelled inside the ring of interest. In this paper, we formalize…

We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…

For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an enumeration operator, mapping each set $W$ of prime numbers to $HTP(\mathbb…

We give examples over arbitrary fields of rings of invariants that are not finitely generated. The group involved can be as small as three copies of the additive group, as in Mukai's examples over the complex numbers. The failure of finite…

Let $E$ be an elliptic curve with positive rank over a number field $K$ and let $p$ be an odd prime number. Let $K_{cyc}$ be the cyclotomic $\mathbb{Z}_p$-extension of $K$ and $K_n$ denote its $n$-th layer. The Mordell--Weil rank of $E$ is…

A negative solution to Hilbert's tenth problem for the ring of integers $O_F$ of a number field $F$ would follow if $\mathbb{Z}$ were Diophantine in $O_F$. Denef and Lipshitz conjectured that the latter occurs for every number field $F$. In…

To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth…

In this paper we first review the history of Hilbert's Tenth Problem, and then study mixed quantifier prefixes over Diophantine equations with integer variables. For example, we prove that $\forall^2\exists^4$ over $\mathbb Z$ is…

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…