Related papers: Reverse engineered Diophantine equations
Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, $d\geq 3,$ and $q$ and $p$ are prime numbers, where $p\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\log(q)$ that lifts every…
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…
Schmidt generalized in 1967 the theory of classical Diophantine approximation to subspaces of $\R^n$. We consider Diophantine exponents for linear subspaces of $\R^n$ which generalize the irrationality measure for real numbers. Using…
We give a procedure for "reverse engineering" a closed, simply connected, Riemannian manifold with bounded local geometry from a sparse chain complex over $\mathbb{Z}$. Applying this procedure to chain complexes obtained by "lifting"…
We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…
A new interpretation and applications of the ``Diophantine'' and factorisation properties of {\em finite} orthogonal polynomials in the Askey scheme are explored. The corresponding twelve polynomials are the ($q$-)Racah, (dual, $q$-)Hahn,…
Projection theorems of divergences enable us to find reverse projection of a divergence on a specific statistical model as a forward projection of the divergence on a different but rather "simpler" statistical model, which, in turn, results…
In this paper we determine the perfect powers that are sums of three fifth powers in an arithmetic progression. More precisely, we completely solve the Diophantine equation $$ (x-d)^5 + x^5 + (x + d)^5 = z^n,~n\geq 2, $$ where $d,x,z \in…
In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…
We extend the Eruguin result exposed in the paper "Construction of the whole set of ordinary differential equations with a given integral curve" published in 1952 and construct a differential system in $\Bbb{R}^N$ which admits a given set…
Let $K$ be a complete non-Archimedean field $K$ with separated power series, treated in the analytic Denef--Pas language. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$, whereby…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
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…
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…
Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…
The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…
Let $A$ be an integral domain with quotient field $K$ of characteristic $0$ that is finitely generated as a $\mathbb{Z}$-algebra. Denote by $D(F)$ the discriminant of a polynomial $F\in A[X]$. Further, given a finite etale algebra $\Omega$,…
Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots…