Euclid's Algorithm in Cubic Fields with Complex Conjugates
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)].
- Euclidean number fields of large degree
- The Euclidean algorithm in algebraic number fields
- scientific article; zbMATH DE number 3140585 (Why is no real title available?)
- The Euclidean Algorithm in Cubic Number Fields
- The Euclidean Condition in Pure Cubic and Complex Quartic Fields
- Non-Galois cubic fields which are Euclidean but not norm-Euclidean
- Algorithmic aspects of cubic function fields
- Note on the Euclidean Algorithm
- The restricted Nagata's pairwise algorithm and the Euclidean algorithm
This page was built for publication: Euclid's Algorithm in Cubic Fields with Complex Conjugates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133715)