Abstract
In this chapter we solve the problems of deciding equivalence and finding the minimum of forms of negative discriminant. First we show, that it suffices to solve those problems for positive definite forms. Then we solve the problems for positive definite forms using reduction theory.
This is a preview of subscription content, log in via an institution to check access.
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
© 2007 Springer
About this chapter
Cite this chapter
Buchmann, J., Vollmer, U. (2007). Reduction of Positive Definite Forms. In: Binary Quadratic Forms. Algorithms and Computation in Mathematics, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46368-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-46368-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46367-2
Online ISBN: 978-3-540-46368-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)