Reduction in purely cubic function fields of unit rank one
The author gives a complete analysis of the algorithm used to obtain a reduced basis of a fractional ideal in a purely cubic function field of unit rank one. This algorithm has been presented and used by the author [J. Théor. Nombres Bordx. 13, 609--631 (2001; Zbl 0995.11064)] to study the ideal arithmetic and infrastructure in such function fields. The author answers questions concerning the complexity of a reduction step, the precision required in the truncation of a Puiseux series, and the size of the quantities involved in the algorithm. For the entire collection see [Zbl 0960.00039].
- Ideal arithmetic and infrastructure in purely cubic function fields
- On reduced Arakelov divisors of real quadratic fields
- Unit computation in purely cubic function fields of unit rank 1
- Computation of the Fundamental Units and the Regulator of a Cyclic Cubic Function Field
- Reduced ideals from the reduction algorithm
- Reduction of an algebraic function field modulo a prime in the constant field
This page was built for publication: Reduction in purely cubic function fields of unit rank one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739469)
