Gauss composition and generalizations

From MaRDI portal





The author sketches an unprecedented conceptualization of Gauss's composition of binary quadratic forms in his papers [Higher composition laws. I--V Ann. Math. (2) 159, No. 1, 217-250 2004; Zbl 1072.11078); No. 2, 865-886 (2004; Zbl 1169.11044), No. 3, 1329--1360 (2004; Zbl 1169.11045)]. The idea is that the arithmetic concept (ideal classes) is parametrized by an integral lattice (of coefficients) subject to polynomial inequalities (reduction laws) limited by a (discriminant) function. The composition is now a matter of lattice relations. The binary cubic forms were included in the structure already by Hermite and Mathews (and Berwick). The fast algorithm in this case is due to \textit{K. Belabas} [A fast algorithm to compute cubic fields, Math. Comput. 66, 1213--1237 (1997; Zbl 0882.11070)]. There are, however, at least 14 analogous (tabulated) cases, including, most remarkably, quartic and quintic forms (with their resolvents). A relationship is implied (in the table) between (generalized) composition and exceptional Lie groups, and, for the compilation, computability is discussed in principle. For the entire collection see [Zbl 0992.00024].











This page was built for publication: Gauss composition and generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737470)