Related papers: Hilbert's Tenth Problem in Coq (Extended Version)

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…

Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…

By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on single-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

We perform the analytic continuation of solutions to the hypergeometric differential equation of order $n$ to the third regular singularity, usually denoted $z=1$, with the help of recurrences of their Mellin--Barnes integral…

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…

An asymptotic formula which holds almost everywhere is obtained for the number of solutions to the Diophantine inequalities |qA-p|<\psi(|q|), where A is an n by m matrix (m>1) over the field of formal Laurent series with coefficients from a…

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 give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

Assuming a certain form of resolution of singularities, we prove a general existential Ax-Kochen/Ershov principle for tamely ramified fields in all characteristics. This specializes to well-known results in residue characteristic $0$ and…

We extend the key formula which intertwines multiplicative Markoff-Lagrange spectrum and symbolic dynamics. The proof uses complex analysis and elucidates the strategy of the problem. Moreover, the new method applies to a wide variety of…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…

In one-dimensional Diophantine approximation, the Diophantine properties of a real number are characterized by its partial quotients, especially the growth of its large partial quotients. Notably, Kleinbock and Wadleigh [Proc. Amer. Math.…

This expository article covers the recent developments surrounding Hilbert's tenth problem for finitely generated rings. We start by recounting the history of Hilbert's tenth problem over the integers, which was resolved negatively by…

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…

Let $K$ be a quadratic imaginary extension of $\mathbb{Q}$, let $S$ be a finite nonempty set of non archimedean places, and let $\mathcal{O}_{K,S}$ denote the ring of $S$-integers of $K$. We show that there is no algorithm which solves the…

This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…