Abstract
A new algorithm for fording the minimal solutions of systems of linear Diophantine equations has recently been published. In its description the emphasis was put on the mathematical aspects of the algorithm. In complement to that, in this paper another presentation of the algorithm is given which may be of use for anyone wanting to implement it.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Boudet, A., Contejean E., and Devie, H.: A new AC Unification algorithm with an algorithm for solving systems of Diophantine equations. In Proceedings of the 5th Conference on Logic and Computer Science, IEEE, 289–299, 1990.
Clausen, M., and Fortenbacher, A.: Efficient solution of linear Diophantine equations. J. Symbolic Computation, 8, 201–216, 1989.
Domenjoud, E.: Outils pour la Déduction Automatique dans les Théories Associatives-Commutatives. These de doctorat, Université de Nancy I, 1991.
Elliott, E. B.: On linear homogenous Diophantine equations. Quart. J. Pure Appl. Math., 34, 348–377, 1903.
Filgueiras, M., and Tomás, A. P.: Fast Methods for Solving Linear Diophantine Equations. In M. Filgueiras, L. Damas (eds.) Progress in Artificial Intelligence — 6th Portuguese Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence 727, Springer-Verlag, 297–306, 1993.
Filgueiras, M., and Tomas, A. P.: A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation. J. Symbolic Computation, 19, 507–526, 1995.
Huet, G.: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations. Information Processing Letters, 7(3), pp. 21–78, 1978.
Lambert, J.-L.: Une borne pour les générateurs des solutions entières positives d'une équation diophantienne linéaire. Comptes Rendus de l'Académie des Sciences de Paris, t. 305, série I, 39–40, 1987.
MacMahon, P.: Combinatory Analysis, 2. Chelsea Publishing Co., 1918.
Moulinet-Ossola, C.: Algorithmique des Réseaux et des Systèmes Diophantiens Linéaires. These de doctorat, Université de Nice Sophia-Antipolis, 1995.
Pottier, L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In R. V. Book (ed.), Proceedings of the 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 488, Springer-Verlag, 162–173, 1991.
A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience, 1986.
Stanley, R.P.: Enumerative Combinatorics, Vol I, The Wadsworth & Brooks/Cole Mathematics Series, 1986.
Tomás, A. P., Filgueiras, M.: Solving linear Diophantine equations using the geometric structure of the solution space. In H. Common (ed.), Rewriting Techniques and Applications. Proceedings, Lecture Notes in Computer Science 1232, Springer-Verlag, 269–283, 1997.
Tomás, A. P.: On Solving Linear Diophantine Constraints. Tese de Doutoramento, Faculdade de Ciěncias da Universidade do Porto, 1997.
Tomás, A. P., Filgueiras, M.: Exploiting the Geometric Structure of the Solution Space in Solving Linear Diophantine Equations. Internal Report, DCC & LIACC, Universidade do Porto, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tomás, A.P., Filgueiras, M. (1997). An algorithm for solving systems of linear diophantine equations in naturals. In: Coasta, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 1997. Lecture Notes in Computer Science, vol 1323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023912
Download citation
DOI: https://doi.org/10.1007/BFb0023912
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63586-4
Online ISBN: 978-3-540-69605-6
eBook Packages: Springer Book Archive