Corpus ID: 237213255

Diophantine equations: a systematic approach

  title={Diophantine equations: a systematic approach},
  author={Bogdan Grechuk},
By combining computer assistance with human reasoning, we have solved the Hilbert’s tenth problem for all polynomial Diophantine equations of size at most 28, where the size is defined in [37]. In addition, we have solved this problem for all two-variable Diophantine equations of size at most 31, all symmetric equations of size at most 36, and all three-monomial equations of size at most 45. In each category, we identified the smallest equations for which the Hilbert’s tenth problem remains… Expand


Diophantine equations
The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For n = 2 such a procedure is well known, when new variables areExpand
Algorithms for the Solution of Systems of Linear Diophantine Equations
Two algorithms for the solution of linear Diophantine systems, which well restrain intermediate expression swell, are presented and a polynomial time bound is derived. Expand
Hilbert's Tenth Problem for Fixed d and n
  • W. Gasarch
  • Mathematics, Computer Science
  • Bull. EATCS
  • 2021
This paper surveys what is known for the cases of bounding the degree of the polynomial and the number of variables for Hilbert's 10th problem. Expand
Hilbert's Tenth Problem: Refinements and Variants
Hilbert’s 10th problem, stated in modern terms, is Find an algorithm that will, given p ∈ Z[x1, . . . , xn], determine if there exists a1, . . . , an ∈ Z such that p(a1, . . . , an) = 0. Davis,Expand
Further results on Hilbert’s Tenth Problem
Hilbert’s Tenth Problem (HTP) asked for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring ℤ of integers. This was finallyExpand
Solving Genus Zero Diophantine Equations with at Most Two Infinite Valuations
A practical general method for the explicit determination of all integer solutions of the diophantine equation f(X, Y) = 0 to have infinitely many integer points is described. Expand
The Diophantine equation f(x) = g(y)
have finitely or infinitely many solutions in rational integers x and y? Due to the classical theorem of Siegel (see Theorem 10.1 below), the finiteness problem for (1), and even for a more generalExpand
A quantitative version of Runge's theorem on diophantine equations
(C1) ai,n = am,j = 0 for all non-zero i and j, (C2) ai,j = 0 for all pairs (i, j) satisfying ni+mj > mn, (C3) the sum of all monomials ai,jxy of F for which ni+mj = nm is a constant multiple of aExpand
How to solve a quadratic equation in integers
In answer to a question posed by J. L Britton in (2), we sketch in this note an effective procedure to decide whether an arbitrary quadratic equation with rational coefficients, has a solution inExpand
A Decision Method For Elementary Algebra And Geometry
By a decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K;Expand