Abstract
In this lecture we give a self-contained introduction to the theory of lattices in Euclidean vector spaces. We reinterpret a large class of lattice basis reduction algorithms by using the concept of a “flag”. In our reformulation, lattice basis reduction algorithms are more appropriately called “flag reduction” algorithms. We address a problem that arises when one attempts to find a particularly good flag for a given lattice.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. I. Aardal, Lattice basis reduction and integer programming, rapport UU-CS-1999–37, Informatica Instituut, Universiteit Utrecht, 1999.
A. Akhavi, Worst-case complexity of the optimal LLL algorithm, pp. 355–366 in Proceedings of Latin American theoretical informatics LATIN 2000, Lecture Notes in Computer Science 1776, Springer-Verlag, New York, 2000.
H. Cohen, A course in computational algebraic number theory, Springer-Verlag, Berlin, 1993.
A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.
H. W. Lenstra, Jr., Integer programming with a fixed number of variables, report 81–03, Mathematisch Instituut, Universiteit van Amsterdam, April, 1981.
H. W. Lenstra, Jr., Integer programming with a fixed number of variables, Math. Oper. Res. 8 (1983), 538–548.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Basel AG
About this paper
Cite this paper
Lenstra, H.W. (2001). Flags and Lattice Basis Reduction. In: Casacuberta, C., Miró-Roig, R.M., Verdera, J., Xambó-Descamps, S. (eds) European Congress of Mathematics. Progress in Mathematics, vol 201. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8268-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8268-2_3
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9497-5
Online ISBN: 978-3-0348-8268-2
eBook Packages: Springer Book Archive