Abstract
The aim of this chapter is to describe an algorithm due to Voronoi which attaches to a perfect quadratic form a finite number of contiguous (or neigh-bouring) perfect forms and allows in this way to find in a finite number of steps all perfect forms with given minimum and dimension. We shall moreover solve explicitly some particular cases and explain succinctly what can be done for non-perfect forms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Martinet, J. (2003). The Voronoi Algorithm. In: Perfect Lattices in Euclidean Spaces. Grundlehren der mathematischen Wissenschaften, vol 327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05167-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-05167-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07921-4
Online ISBN: 978-3-662-05167-2
eBook Packages: Springer Book Archive