scientific article; zbMATH DE number 1114504
As the authors state, this paper can be viewed as an algorithmic version of earlier results by \textit{H. Davenport} and \textit{A. Heilbronn} [Bull. Lond. Math. Soc. 1, 345-348 (1969; Zbl 0211.38602); Proc. R. Soc. Lond., Ser. A 322, 405-420 (1971; Zbl 0212.08101)]. The authors develop the known correspondence between cubic fields and binary cubic forms and obtain a discriminant preserving bijection between isomorphism classes of cubic fields and binary cubic forms belonging to a suitable set \(U\) of such forms. Their constructive approach yields an algorithm for testing whether a cubic form is the image of a cubic field under the Davenport-Heilbronn map. Also, appropriate notions of reduction (which necessarily differ for real and complex fields) allow to characterize unique representatives for cubic forms \(F\) in \(U\). Hence, with their method, cubic fields of small discriminant can be generated much faster than previously known. For the entire collection see [Zbl 0872.00022].
- scientific article; zbMATH DE number 1210374
- Cubic forms over algebraic number fields
- Cubic residues and binary quadratic forms
- Arithmetic of binary cubic forms
- On the representations of numbers by binary cubic forms
- On binary cubic forms: II
- scientific article; zbMATH DE number 1373425
- Binomial squares in pure cubic number fields
- On binary cubic and quartic forms
- Cubic fields with geometry
- On the representation of unity by binary cubic forms
- Tabulation of cubic function fields via polynomial binary cubic forms
- scientific article; zbMATH DE number 1210374 (Why is no real title available?)
- A fast algorithm to compute cubic fields
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
- Computing elliptic curves over \(\mathbb {Q}\)
- Extremal families of cubic Thue equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377089)