We introduce a novel application of Gröbner bases to solve (non-homogeneous) systems of integer linear equations over integers. For this purpose, we present a new algorithm which ascertains whether a linear system of equations has an integer solution or not; in the affirmative case, the general integer solution of the system is determined.
1. Introduction. The purpose of this paper is to establish some general finiteness results (cf. Theorems 1 and 2) for resultant equations over an arbitrary finitely generated integral domain R over ℤ. Our Theorems 1 and 2 improve and generalize some results of Wirsing [25], Fujiwara [6], Schmidt [21] and Schlickewei [17] concerning resultant equations over ℤ. Theorems 1 and 2 are consequences of a finiteness result (cf. Theorem 3) on decomposable form equations over R. Some applications of Theorems...
In this paper we consider some special classes of Diophantine equations connected with McFarland's and Ma's conjectures about difference sets in abelian groups and we obtain an extension of known results.
Let f ∈ ℚ [X] be a polynomial without multiple roots and with deg(f) ≥ 2. We give conditions for f(X) = AX² + BX + C such that the Diophantine equation f(x)f(y) = f(z)² has infinitely many nontrivial integer solutions and prove that this equation has a rational parametric solution for infinitely many irreducible cubic polynomials. Moreover, we consider f(x)f(y) = f(z)² for quartic polynomials.