Abstract
Let K be a cyclic number field of prime degree ℓ. Heilbronn showed that for a given ℓ there are only finitely many such fields that are norm-Euclidean. In the case of ℓ = 2 all such norm-Euclidean fields have been identified, but for ℓ ≠ 2, little else is known. We give the first upper bounds on the discriminants of such fields when ℓ > 2. Our methods lead to a simple algorithm which allows one to generate a list of candidate norm-Euclidean fields up to a given discriminant, and we provide some computational results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
