Tabulation of cubic function fields via polynomial binary cubic forms

DOI10.1090/S0025-5718-2012-02591-9MaRDI QIDQ2840015zbMATH OpenFDO

Authors Pieter Rozenhart, Michael J. Jacobson jun., Renate Scheidler

Publication date 17 July 2013

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

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

zbMATH Keywords

arithmetic of algebraic function fieldsbinary cubic formscubic function fieldsfield tabulation

Mathematics Subject Classification ID

Cubic and quartic extensions (11R16) Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40)

Abstract: We present a method for tabulating all cubic function fields over $mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $mathbb{F}_q^{\ast }$, up to a given bound $B$ on the degree of $D$. Our method is based on a generalization of Belabas' method for tabulating cubic number fields. The main theoretical ingredient is a generalization of a theorem of Davenport and Heilbronn to cubic function fields, along with a reduction theory for binary cubic forms that provides an efficient way to compute equivalence classes of binary cubic forms. The algorithm requires $O(B^4{q}^B)$ field operations as $Bightarrowinfty$. The algorithm, examples and numerical data for $q=5,7,11,13$ are included.

Recommendations

• Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian
• A fast algorithm to compute cubic fields
• On quadratic fields with large 3-rank
• Cubic fields with geometry
• Computations in cubic function fields of characteristic three
• scientific article; zbMATH DE number 1114504
• Construction of all cubic function fields of a given square-free discriminant
• Algorithmic Number Theory
• An Explicit Treatment of Cubic Function Fields with Applications
• On computing non-Galois cubic global function fields of prescribed discriminant in characteristic \(>3\)

Cites work

• A fast algorithm to compute cubic fields
• Advanced Topics in Computional Number Theory
• Algebraic Function Fields and Codes
• Algorithmic Number Theory
• An Explicit Treatment of Cubic Function Fields with Applications
• Binary quadratic forms. An algorithmic approach
• Computing quadratic function fields with high 3-rank via cubic field tabulation
• Construction of all cubic function fields of a given square-free discriminant
• Counting extensions of function fields with bounded discriminant and specified Galois group
• Density of discriminants of cubic extensions.
• How to distinguish hyperelliptic curves in even characteristic.
• scientific article; zbMATH DE number 1716471 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 195204 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• On quadratic fields with large 3-rank
• On the Density of Discriminants of Cubic Fields
• On the density of discriminants of cubic fields. II
• Projective geometry. An introduction
• Reduction of Binary Cubic and Quartic Forms
• Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian
• The density of discriminants of quartic rings and fields
• The number of extensions of a number field with fixed degree and bounded discriminant

Cited in

(8)

• The unit rank classification of a cubic function field by its discriminant
• On calculating the number \(N(D)\) of global cubic fields \(F\) of given discriminant \(D\)
• Computing quadratic function fields with high 3-rank via cubic field tabulation
• Construction of all cubic function fields of a given square-free discriminant
• Constructing and tabulating dihedral function fields
• A fast algorithm to compute cubic fields
• Cubic function fields with prescribed ramification
• Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian

Describes a project that uses

Uses Software

• NTL

This page was built for publication: Tabulation of cubic function fields via polynomial binary cubic forms

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