Related papers: The Diophantine problem in finitely generated comm…
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
Let $K= \mathbf{Q}(\sqrt{d})$ be a quadratic field and $\mathcal{O}_{K}$ be its ring of integers. We study the solvability of the Diophantine equation $r + s + t = rst = 2$ in $\mathcal{O}_{K}$. We prove that except for $d= -7, -1, 17$ and…
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) =…
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…
Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…
We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…
Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…
This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…
In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…
We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely…
For a positive proportion of primes $p$ and $q$, we prove that $\mathbb{Z}$ is Diophantine in the ring of integers of $\mathbb{Q}(\sqrt[3]{p},\sqrt{-q})$. This provides a new and explicit infinite family of number fields $K$ such that…
We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…
We extend results of Denef, Zahidi, Demeyer and the second author to show the following. (1) Rational integers have a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. (2)…
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…
We establish that all rings of $S$-integers are universally definable in function fields in one variable over certain ground fields including global and non-archimedean local fields. That is, we show that the complement of such a ring of…
In this paper we obtain three undecidable results for exponential diophantine equations over the field $\mathbb Q$ of rational numbers. For example, we prove that there is no algorithm to decide the solvability of a general exponential…
The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…
We study metabelian groups $G$ given by full rank finite presentations $\langle A \mid R \rangle_{\mathcal{M}}$ in the variety $\mathcal{M}$ of metabelian groups. We prove that $G$ is a product of a free metabelian subgroup of rank…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…