Abstract
In Example 1.1.7, we were able to find the minimum of the form f using a transformation of variables. In this section, we generalize this approach. We introduce transformations that do not change the minimum of a form. Also, the numbers that can be represented by f remain the same. Those transformations will enable us to simplify the representation problem and the minimum problem.
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). Equivalence of 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-46368-9_3
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)