Abstract
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of methods we developed and describe two of them, called Slopes algorithm and Rectangles algorithm. From empirical evidence obtained by directly comparing our methods with others, and which is partly presented here, we are convinced that ours are the fastest known to date when the equation coefficients are not too small (ie., greater than 2 or 3).
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. Thése 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.: A Congruence-based Method with Slope Information for Solving Linear Constraints over Natural Numbers. Presented at the Workshop on Constraint Logic Programming '92, Marseille. Also as internal report, Centro de Informática da Universidade do Porto, 1992a.
Filgueiras, M. and Tomás, A. P.: Solving Linear Diophantine Equations: The Slopes Algorithm. Centro de Informática da Universidade do Porto, 1992b.
Filgueiras, M. and Tomás, A. P.: A Note on the Implementation of the MacMahon Elliott Algorithm. Centro de Informática da Universidade do Porto, 1992c.
Guckenbiehl, T. and Herold, A.: Solving Linear Diophantine Equations. Memo SEKI-85-IV-KL, Universität Kaiserslautern, 1985.
Huet, G.: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations. Information Processing Letters, 7(3), 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.
Stanley, R.: Linear homogeneous Diophantine equations and magic labelings of graphs. Duke Math. J., 40, 607–632, 1973.
Tomás, A. P. and Filgueiras, M.: A new method for solving linear constraints on the natural numbers. In P. Barahona, L. Moniz Pereira, A. Porto (eds.), Proceedings of the 5th Portuguese Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence 541, Springer-Verlag, 30–44, 1991a.
Tomás, A. P. and Filgueiras, M.: A Congruence-based Method for Finding the Basis of Solutions to Linear Diophantine Equations. Centro de Informática da Universidade do Porto, 1991b.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filgueiras, M., Tomás, A.P. (1993). Fast methods for solving linear diophantine equations. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_55
Download citation
DOI: https://doi.org/10.1007/3-540-57287-2_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57287-9
Online ISBN: 978-3-540-48036-5
eBook Packages: Springer Book Archive