Solving systems of linear diophantine equations: An algebraic approach

33Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe through an algebraic and geometrical study, a new method for solving systems of linear diophantine equations. This approach yields an algorithm which is intrinsically parallel. In addition to the algorithm, we give a geometrical interpretation of the satisfiability of an homogeneous system, as well as upper bounds on height and length of all minimal solutions of such a system. We also show how our results apply to inhomogeneous systems yielding necessary conditions for satisfiability and upper bounds on the minimal solutions.

Cite

CITATION STYLE

APA

Domenjoud, E. (1991). Solving systems of linear diophantine equations: An algebraic approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 520 LNCS, pp. 141–150). Springer Verlag. https://doi.org/10.1007/3-540-54345-7_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free