Jingwei Chen
ABSTRACT
The HJLS and PSLQ algorithms are the de facto standards for discovering non-trivial integer relations between a given tuple of real numbers. In this work, we provide a new interpretation of these algorithms, in a more general and powerful algebraic setup: we view them as special cases of algorithms that compute the intersection between a lattice and a vector subspace. Further, we extract from them the first algorithm for manipulating finitely generated additive subgroups of a euclidean space, including projections of lattices and finite sums of lattices. We adapt the analyses of HJLS and PSLQ to derive correctness and convergence guarantees.
- L. Babai, B. Just, and F. Meyer auf der Heide. On the limits of computations with the floor function. Inf. Comput., 78(2):99--107, 1988. Google Scholar
Digital Library
- P. Borwein. Computational Excursions in Analysis and Number Theory. Springer, New York, 2002.Google ScholarCross Ref
- N. Bourbaki. Elements of Mathematics: General Topology, Part II. Addison-Wesley, Massachusetts, 1967. A translation of phÉléments de Mathématique : Topologie Générale, Hermann, Paris, 1966.Google Scholar
- D. Dadush and O. Regev. Lattices, convexity and algorithms: Dual lattices and lattice membership problems, 2013. Notes of the second lecture of a course taught at New York University. Available from http://cs.nyu.edu/~dadush/.Google Scholar
- H. Ferguson and D. Bailey. A polynomial time, numerically stable integer relation algorithm. Technical Report RNR-91-032, SRC-TR-92-066, NAS Applied Research Branch, NASA Ames Research Center, July 1992.Google Scholar
- H. Ferguson, D. Bailey, and S. Arno. Analysis of PSLQ, an integer relation finding algorithm. Math. Comput., 68(225):351--369, 1999. Google ScholarDigital Library
- J. Håstad, B. Just, J. Lagarias, and C. Schnorr. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput., 18(5):859--881, 1989. Preliminary version: Proceedings of STACS'86, pp. 105--118, 1986. Google ScholarDigital Library
- A. Lenstra, H. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515--534, 1982.Google ScholarCross Ref
- J. Martinet. Perfect Lattices in Euclidean Spaces. Springer, Berlin, 2003.Google ScholarCross Ref
- A. Meichsner. Integer Relation Algorithms and the Recognition of Numerical Constants. Master's thesis, Simon Fraser University, 2001.Google Scholar
- A. Meichsner. The Integer Chebyshev Problem: Computational Explorations. PhD thesis, Simon Fraser University, 2009. Google ScholarDigital Library
- M. Pohst. A modification of the LLL reduction algorithm. J. Symb. Comput., 4(1):123--127, 1987. Google ScholarDigital Library
- O. Regev. Lattices in Computer Science, 2004. Lecture notes of a course taught at Tel Aviv University. Available from http://www.cims.nyu.edu/~regev/.Google Scholar
- A. Schönhage. Factorization of univariate integer polynomials by Diophantine approximation and an improved basis reduction algorithm. In Proceedings of ICALP, volume 172 of LNCS, pages 436--447. Springer, 1984. Google ScholarDigital Library
Index Terms
- A new view on HJLS and PSLQ: sums and projections of lattices
Recommendations
Two variants of HJLS-PSLQ with applications
SNC '14: Proceedings of the 2014 Symposium on Symbolic-Numeric ComputationThe HJLS and PSLQ algorithms are the most popular algorithms for finding nontrivial integer relations for several real numbers. It has been already shown that PSLQ is essentially equivalent to HJLS under certain settings. We here call them HJLS-PSLQ.
In ...
A complexity analysis of a Jacobi method for lattice basis reduction
C3S2E '12: Proceedings of the Fifth International C* Conference on Computer Science and Software EngineeringThe famous LLL algorithm is the first polynomial time lattice reduction algorithm which is widely used in many applications. In this paper, we present a novel weak Quasi-Jacobi lattice basis reduction algorithm based on a polynomial time algorithm, ...
Factor Congruence Lifting Property
In previous work, we have introduced and studied a lifting property in congruence---distributive universal algebras which we have defined based on the Boolean congruences of such algebras, and which we have called the Congruence Boolean Lifting ...
Comments