Abstract
We present algorithms, which when given a real vector x∈ℝn and a parameter k∈ℕ as input either find an integer relation m∈ℤn, m≠0 with xTm=0 or prove there is no such integer relation with ‖m‖≦2k. One such algorithm halts after at most O(n3(k+n)) arithmetic operations using real numbers. It finds an integer relation that is no more than \(2^{\frac{{n - 2}}{2}}\)times longer than the length of the shortest relation for x. Given a rational input x∈ℚn this algorithm halts in polynomially many bit operations. The basic algorithm of this kind is due to Ferguson and Forcade (1979) and is closely related to the Lovàsz (1982) lattice basis reduction algorithm.
Keywords
- Arithmetic Operation
- Minimal Polynomial
- Euclidean Algorithm
- Exchange Step
- Short Relation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Bergman (1980) Notes on Ferguson and Forcade's Generalized Euclidean Algorithm. Unpublished paper. University of California at Berkeley.
A. Brentjes (1981) Multi-dimensional Continued Fraction Algorithms. Math. Centre Tracts No. 145. Universiteit Amsterdam.
H.R.P. Ferguson and R.W. Forcade (1979) Generalization of the euclidean algorithm for real numbers to all dimensions higher than two. Bulletin of the AMS 1,6 pp. 912–914.
H.R.P. Ferguson (1984) A non-inductive GL(n,ℤ) algorithm that constructs integral linear relations. Preprint. Brigham Young University
H.R.P. Ferguson (1985) A short proof of the existence of vector Euclidean algorithms to appear in Proceedings of the AMS.
C.G.J. Jacobi (1868) Allgemeine Theorie der Kettenbruchähnlichen Algorithmen. J. reine Angew. Math. 69 (1969), 29–64.
A.K. Lenstra, H.W. Lenstra Jr., and L. Love (1982) Factoring polynomials with rational coefficients. Math. Ann. 21, 515–534.
R. Kannan, A.K. Lenstra, and L. Lovàsz (1984) Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Proc. 16th Ann. ACM Symp. on Theory of Computing, pp. 191–200.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hastad, J., Helfrich, B., Lagarias, J., Schnorr, C.P. (1985). Polynomial time algorithms for finding integer relations among real numbers. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_69
Download citation
DOI: https://doi.org/10.1007/3-540-16078-7_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16078-6
Online ISBN: 978-3-540-39758-8
eBook Packages: Springer Book Archive
