An algorithm to compute relative cubic fields

Details An algorithm to compute relative cubic fields An algorithm to compute relative cubic fields

2011-03-15

arxiv.org/abs/1103.2901v4

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An algorithm to compute relative cubic fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithm to compute relative cubic fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm to compute relative cubic fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138922