Algorithmic Aspects of Cubic Function Fields
This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rational function field of finite characteristic at least five; the signature can be determined solely from the coefficients of the defining curve. We go on to study such extensions from an algorithmic perspective, presenting efficient arithmetic of reduced ideals in the maximal order as well as algorithms for computing the fundamental unit(s) and the regulator of the extension.
Unable to display preview. Download preview PDF.
- 4.Delone, B.N., Fadeev, D.K.: The Theory of Irrationalities of the Third Degree. Transl. Math. Monographs 10, Amer. Math. Soc., Providence, Rhode Island (1964)Google Scholar
- 7.Lee, Y.: The unit rank classification of a general cubic function field by its discriminant (preprint)Google Scholar
- 14.Voronoi, G.F.: On a Generalization of the Algorithm of Continued Fractions. Doctoral Dissertation, Warsaw (1896) (in Russian)Google Scholar