Computing cubic fields in quasi-linear time

DOI10.1007/3-540-61581-4_37MaRDI QIDQ4375593zbMATH OpenFDO

Authors Karim Belabas

Publication date 20 December 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61581-4_37

zbMATH Keywords

algorithmbinary cubic formscomputing cubic fields

Mathematics Subject Classification ID

Forms of degree higher than two (11E76) Cubic and quartic extensions (11R16) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Symbolic computation and algebraic computation (68W30)

Review text

A fast algorithm is given for computing cubic fields. The idea originates from \textit{H. Davenport} and \textit{H. Heilbronn} [Proc. R. Soc. Lond., Ser. A 322, 405-420 (1971; Zbl 0212.08101)], the proofs are detailed in [\textit{K. Belabas}, Math. Comput. 66, 1213-1237 (1997; Zbl 0882.11070)] by the author. The idea of the algorithm is to associate a class of binary cubic forms with the same discriminant to the cubic field, then a canonical representative in this class. The essential point is to have an explicit description of the image of this mapping. The algorithm was implemented in ANSI C on a DEC alpha. The reader finds amazing running times at the end of the paper. For the entire collection see [Zbl 0852.00023].

Recommendations

• A fast algorithm to compute cubic fields
• scientific article; zbMATH DE number 1210374
• On Totally Real Cubic Fields

Cited in

(15)

• Cubic fields with geometry
• On calculating the number \(N(D)\) of global cubic fields \(F\) of given discriminant \(D\)
• A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
• On the Computation of a Table of Complex Cubic Fields with Discriminant D > -10 6
• On Totally Real Cubic Fields
• Computation of the Class Number and Class Group of a Complex Cubic Field
• Minimal bases for cubic fields
• scientific article; zbMATH DE number 1210374 (Why is no real title available?)
• A fast algorithm to compute cubic fields
• scientific article; zbMATH DE number 2163029 (Why is no real title available?)
• On quadratic fields with large 3-rank
• An algorithm to compute relative cubic fields
• Fast ideal cubing in imaginary quadratic number and function fields
• Algorithmic Number Theory
• A numerical study of Dedekind's cubic class number formula

This page was built for publication: Computing cubic fields in quasi-linear time

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