Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-20T16:38:59.748Z Has data issue: false hasContentIssue false
  • English
  • Français

Euclidean Rings of Algebraic Integers

Published online by Cambridge University Press:  20 November 2018

Malcolm Harper  and
M. Ram Murty
Malcolm Harper
Affiliation:
Champlain College, Montreal, Canada e-mail: [email protected]
M. Ram Murty
Affiliation:
Department of Mathematics, Queen's University, Kingston, Ontario, K7L 3N6 e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let $K$ be a finite Galois extension of the field of rational numbers with unit rank greater than 3. We prove that the ring of integers of $K$ is a Euclidean domain if and only if it is a principal ideal domain. This was previously known under the assumption of the generalized Riemann hypothesis for Dedekind zeta functions. We now prove this unconditionally.

Keywords

11R0411R2711R3211R4211N36
Type
Research Article
Information
Canadian Journal of Mathematics , Volume 56 , Issue 1 , 01 February 2004 , pp. 71 - 76
Copyright
Copyright © Canadian Mathematical Society 2004

References

[BFI] Bombieri, E., Friedlander, J. and Iwaniec, H., Primes in arithmetic progressions to large moduli. Acta Math. 156(1986), 203–251.Google Scholar
[CM] Clark, D. and Murty, M. Ram, The Euclidean algorithm for Galois extensions of ℚ . J. Reine Angew. Math. 459(1995), 151–162.Google Scholar
[GM] Gupta, R. and Murty, M. Ram, A remark on Artin's conjecture. Invent. Math. 78(1984), 127–130.Google Scholar
[GMM] Gupta, R., Murty, M. Ram and Murty, V. Kumar, The Euclidean algorithm for S-integers. In: Number Theory (eds. Kisilevsky, H. and Labute, J.), CMS Conf. Proc. 7(1987), 189–201.Google Scholar
[H] Harper, M., ℤ[] is Euclidean. Canad. J. Math. 56(2004), 55–70.Google Scholar
[L] Lenstra, H., Euclidean number fields, I. Math. Intelligencer 2(1979), 6–15.Google Scholar
[M] Motzkin, Th., The Euclidean algorithm. Bull. Amer. Math. Soc. 55(1949), 1142–1146.Google Scholar
[KM] Murty, V. Kumar, Bounded and Finite Generation of Arithmetic Groups. In: Number Theory (ed. Dilcher, K.), CMS Conf. Proc. 15(1995), 249–261.Google Scholar
[MM] Murty, M. Ram and Murty, V. Kumar, A variant of the Bombieri-Vinogradov theorem. In: Number Theory (eds. Kisilevsky, H. and Labute, J.), CMS Conf. Proc. 7(1987), 243–272.Google Scholar
[S] Samuel, P., About Euclidean Rings. J. Algebra 19(1971), 282–301.Google Scholar
[W] Weinberger, P., On Euclidean rings of algebraic integers. In: Analytic Number Theory (St. Louis, 1972), Proc. Sympos. Pure Math. 24(1973), 321–332.Google Scholar