A fast algorithm to compute cubic fields
The author develops an algorithm for computing tables of cubic fields which is much faster than those previously known. The key ingredient is a bijection between equivalence classes of primitive irreducible integral binary cubic forms \(F(x,y)= ax^3+ bx^2y+ cxy^2+ dy^3\in\mathbb{Z}[x, y]\) subject to an additional discriminant condition and isomorphism classes of cubic fields \(K\) (which accordingly are generated by a root of \(F(x,1)\)). That idea goes back to \textit{H. Davenport} and \textit{H. Heilbronn} [Proc. R. Soc. Lond., Ser. A 322, 405-420 (1971; Zbl 0212.08101)]. By suitable reduction methods for the real and for the complex case, the author obtains a unique representative \(F(x,y)\) for each equivalence class which can easily be calculated. Besides being fast, this representation of cubic fields \(K\) also gives an explicit integral basis for \(K\) and an easy method for computing all prime ideals of \(K\) above any given prime number \(p\). The author used this method for computing all real cubic fields up to discriminant \(D<10^{11}\) (\(6.7\times 10^9\) fields) and all complex fields with discriminant \(D>-10^{11}\) (\(20.4\times 10^9\) fields) in about one month of computation time on a single workstation. In both cases, a list of the first hundred fields (of smallest absolute discriminant) is presented.
- Computing cubic fields in quasi-linear time
- Cubic fields with geometry
- On quadratic fields with large 3-rank
- scientific article; zbMATH DE number 1114504
- scientific article; zbMATH DE number 1210374
- On the Computation of a Table of Complex Cubic Fields with Discriminant D > -10 6
- A Table of Fundamental Pairs of Units in Totally Real Cubic Fields
- Tabulation of cubic function fields via polynomial binary cubic forms
- On Totally Real Cubic Fields
- Corps sextiques contenant un corps cubique (III)
- Nonabelian Cohen-Lenstra moments
- The fast cubic algorithm
- Cubic fields with geometry
- On calculating the number \(N(D)\) of global cubic fields \(F\) of given discriminant \(D\)
- Primes in the Chebotarev density theorem for all number fields (with an appendix by Andrew Fiori)
- On small discriminants of number fields of degree 8 and 9
- Some explicit upper bounds for residues of zeta functions of number fields taking into account the behavior of the prime \(2\)
- Dirichlet series associated to cubic fields with given quadratic resolvent
- Computing quadratic function fields with high 3-rank via cubic field tabulation
- The integer cubic algorithm
- Counting discriminants of number fields
- On the representation of unity by binary cubic forms
- Density of cubic field discriminants
- Tabulation of cubic function fields via polynomial binary cubic forms
- A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
- Quadratic p-ring spaces for counting dihedral fields
- Construction of all cubic function fields of a given square-free discriminant
- Cubic discriminants and arithmetic progressions
- Mordell's equation: a classical approach
- On the \(p\)-adic Stark conjecture at \(s=1\) and applications
- On the Computation of a Table of Complex Cubic Fields with Discriminant D > -10 6
- On Totally Real Cubic Fields
- On the Davenport-Heilbronn theorems and second order terms
- Computation of the Class Number and Class Group of a Complex Cubic Field
- scientific article; zbMATH DE number 3961759 (Why is no real title available?)
- A Table of Fundamental Pairs of Units in Totally Real Cubic Fields
- On Totally Real Cubic Fields with Discriminant D < 10 7
- Secondary terms in counting functions for cubic fields
- Minimal bases for cubic fields
- The Deligne-Mumford compactification of the real multiplication locus and Teichmüller curves in genus 3
- scientific article; zbMATH DE number 1210374 (Why is no real title available?)
- Reduction of Binary Cubic and Quartic Forms
- Tables of octic fields with a quartic subfield
- Errata: “On the computation of a table of complex cubic fields with discriminant 𝐷>-10⁶” [Math. Comp. 55 (1990), no. 191, 313–325; MR1023760 (90m:11155)]
- Computing cubic fields in quasi-linear time
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
- Computing elliptic curves over \(\mathbb {Q}\)
- Constructing complete tables of quartic fields using Kummer theory
- On quadratic fields with large 3-rank
- A Database for Field Extensions of the Rationals
- Small isospectral and nonisometric orbifolds of dimension 2 and 3
- A cubic generalization of Brahmagupta's identity
- Omega results for cubic field counts via lower-order terms in the one-level density
- Cubic function fields with prescribed ramification
- The number of ramified primes in number fields of small degree
- An algorithm to compute relative cubic fields
- Missing class groups and class number statistics for imaginary quadratic fields
- Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian
- Fast ideal cubing in imaginary quadratic number and function fields
- Algorithmic Number Theory
- An error estimate for counting \(S_{3}\)-sextic number fields
- Computing the torsion of the p-ramified module of a number field
- scientific article; zbMATH DE number 3099819 (Why is no real title available?)
- Computational Number Theory, Past, Present, and Future
- Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
- Statistics of genus numbers of cubic fields
- Improved error estimates for the Davenport-Heilbronn theorems
- On the Selmer group and rank of a family of elliptic curves and curves of genus one violating the Hasse principle
- Sampling cubic rings
- Extremal families of cubic Thue equations
- Error estimates for the Davenport-Heilbronn theorems
This page was built for publication: A fast algorithm to compute cubic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340867)
