Skip to main content
Article thumbnail
Location of Repository

Algorithmic aspects of cubic function fields

By R. Scheidler


Abstract. 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.

Publisher: Springer-Verlag
Year: 2004
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.