Euclid's Algorithm in Cubic Fields with Complex Conjugates (Q4133715)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3557891
Language Label Description Also known as
default for all languages
No label defined
    English
    Euclid's Algorithm in Cubic Fields with Complex Conjugates
    scientific article; zbMATH DE number 3557891

      Statements

      Euclid's Algorithm in Cubic Fields with Complex Conjugates (English)
      0 references
      1976
      0 references
      In this paper a description is given of an investigation into the existence of an Euclidean Algorithm (E.A.) in cubic fields whose conjugate fields are complex. If \(K\) is such a field with ring of integers \(O_K\) and if \(N\) is the norm function of \(K\), put \(M(K)= \max_{\alpha\in K} \min_{\gamma\in O_K} |N( \alpha - \gamma)|\). Then \(K\) has an E.A. if and only if \(M(K) <1\) . A method based on this fact produced many fields with an E.A. A method used by \textit{E. S. Barnes} and \textit{H. P. F. Swinnerton-Dyer} [Acta Math. 87, 259--323 (1952; Zbl 0046.27601)] for real quadratic fields was adapted to prove that an E.A. does exist for many fields \(K\). Extensive lists of fields \(K\) with discriminant \(-D\), \(0<D<5000\) give up to date information on the existence and non-existence of an E.A. Previous results of Davenport, Cassels and Godwin are also included [\textit{H. Davenport}, Proc. Lond. Math. Soc., II. Ser. 45, 98--125 (1939; Zbl 0020.29304; JFM 65.0173.04); \textit{J. W. S. Cassels}, Proc. Camb. Philos. Soc. 48, 72--86 (1952; Zbl 0046.04601); \textit{H. J. Godwin}, Q. J. Math., Oxf. II. Ser. 18, 333--338 (1967; Zbl 0159.07201)].
      0 references

      Identifiers