In their celebrated paper On Siegel’s Lemma, Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In this paper, we present the bound in a different form that can be computed in polynomial time. We also give an elementary (and arguably simpler) proof for the bound.

The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite.

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 fin...

This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general and powerful new lower bound for linear forms in three logarithms, together with a combination of classical...

In this paper we introduce the version 2.5 of Normaliz , a program for the computation of Hilbert bases of rational cones and the normalizations of affine monoids. It may also be used for solving diophantine linear systems of inequalities, equations and congruences. We present some of the new features of the program, as well as some recent achievements.

We present a survey of the results investigations one fields dealing with equivalence matrices originated by P. S. Kazimirs’kii and then continued developed his colleagues. formulate standard forms polynomial their finite sets respect to semiscalar generalized pairs over rings. Their applications development methods matrix factorization, solving equations, description structure solutions these ...

A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in the dual lattice, yT A integral such that yT b is fractional. We extend this result to systems that both have equations and inequalities {Ax = b, Cx ≤ d}. We show that a certificate of integral infeasibility is a line...