Euclid's Algorithm in Cubic Fields with Complex Conjugates

DOI10.1112/JLMS/S2-14.1.49zbMATH Open0358.12002OpenAlexW1964068056MaRDI QIDQ4133715FDOQ4133715

Authors: Elizabeth M. Taylor 

Publication date: 1976

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://repository.royalholloway.ac.uk/items/19001ecf-762d-409a-90db-bc40d6c939fd/1/

Recommendations

• The Euclidean Algorithm in Cubic Number Fields
• A computer algorithm for finding new Euclidean number fields
• Some generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean
• Note on the Euclidean Algorithm
• Non-Galois cubic fields which are Euclidean but not norm-Euclidean

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Cubic and quartic extensions (11R16)

Cited In (8)

• The restricted Nagata's pairwise algorithm and the Euclidean algorithm
• The Euclidean Algorithm in Cubic Number Fields
• Euclidean number fields of large degree
• Title not available (Why is that?)
• The Euclidean Condition in Pure Cubic and Complex Quartic Fields
• Note on the Euclidean Algorithm
• Algorithmic Number Theory
• Non-Galois cubic fields which are Euclidean but not norm-Euclidean

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)