An algorithm to compute relative cubic fields

DOI10.1090/S0025-5718-2013-02686-5MaRDI QIDQ5326515zbMATH OpenOpenAlexFDO

Authors Anna Morra

Publication date 6 August 2013

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.2901

zbMATH Keywords

computation of discriminantscubic fieldsDirichlet seriesJulia reductionKummer theoryTaniguchi parametrization

Mathematics Subject Classification ID

Cubic and quartic extensions (11R16) Algebraic number theory computations (11Y40)

Abstract: Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant ideal. The main tools are Taniguchi's generalization of Davenport-Heilbronn parametrisation of cubic extensions, and reduction theory for binary cubic forms over imaginary quadratic fields. Finally, we give numerical data for k=Q(i), and we compare our results with ray class field algorithm ones, and with asymptotic heuristics, based on a generalization of Roberts' conjecture.

Recommendations

• scientific article; zbMATH DE number 1113821
• On quadratic fields with large 3-rank
• A fast algorithm to compute cubic fields
• Computation of the Class Number and Class Group of a Complex Cubic Field
• scientific article; zbMATH DE number 3961759

Cites work

• A fast algorithm to compute cubic fields
• Advanced Topics in Computional Number Theory
• Algorithmic Number Theory
• An inequality for the discriminant of a polynomial
• Computational algebraic number theory
• Density of discriminants of cubic extensions.
• Generators and relations for certain special linear groups
• scientific article; zbMATH DE number 3869516 (Why is no real title available?)
• scientific article; zbMATH DE number 1095994 (Why is no real title available?)
• scientific article; zbMATH DE number 2213922 (Why is no real title available?)
• On the density of discriminants of cubic fields. II
• On the distribution of Galois groups
• Reduction of Binary Cubic and Quartic Forms

Cited in

(9)

• The cubic algorithm
• The integer cubic algorithm
• Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields
• A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
• An algorithm to obtain linear determinantal representations of smooth plane cubics over finite fields
• The Computation of Sextic Fields with a Quadratic Subfield
• The Euclidean Algorithm in Cubic Number Fields
• Absolute reduction of binary forms
• Algorithmic Number Theory

Describes a project that uses

Uses Software

• PARI/GP

This page was built for publication: An algorithm to compute relative cubic fields

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