Integer Algorithms to Solver Diophantine Linear Equations and Systems

In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine equations, in five or more variables, with one of the equations being of degree $\geq 4$. We show that, under certain conditions, the method yields an arbitrarily large number of integer solutions of such diophantine equations and diophantine s...

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b or determines that no such solution exists, provided that b is located sufficiently "deep" in the cone generated by the columns of B. This result improves on some of the previously known conditions that guarantee polynomial-time solvability...

In the first two papers, the author embarked on a study of classes of linear equations over integers satisfying a "Farkas-type" property. As the third paper in this study, the present paper deals with another class of linear equations over integers that has a similar "Farkas-type" property. Furthermore it is shown that if an arbitrary system of equations over integers satisfies the conditions imposed by Farkas' lemma then it has rational solutions of a special type.

The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the equation are of the opposite signs. The author found integer conversions that maintain the asymptotic behavior of the number of integer solutions of algebraic Diophantine equation in the case of the conversion equation to diagonal form. The ...

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one can solve a specific equation related to numbers occurring several times in Pascal's Triangle with state-of-the-art methods.

The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer factorization, algebraic curves, projective curves and data dependency in super computers. Importantly, it has been proved that there is no general method to find solutions of such equations. This paper is an attempt to find numerical solutions...

This paper has been withdrawn by the author because Conjecture 1 is false. Please see arXiv:0901.2093 for a justification that Conjecture 1 is false. The other main results are also available from the above URL.

The author surveys the problem of piecing together integral or rational solutions to Diophantine equations (global structure) from solutions modulo congruences and real solutions (local structure).

Natural phenomenon of coevolution is the reciprocally induced evolutionary change between two or more species or population. Though this biological occurrence is a natural fact, there are only few attempts to use this as a simile in computation. This paper is an attempt to introduce reciprocally induced coevolution as a mechanism to counter problems faced by a typical genetic algorithm applied as an optimization technique. The domain selected for testing the efficacy of the p...

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two appropriate trivial parametric solutions and obtaining infinitely many nontrivial parametric solutions. Also we work out some examples, in particular the Diophantine systems of A^k+B^k+C^k=D^k+E^4; k=1,3.