The Euclidean algorithm for number fields and primitive roots

Type: Article

Publication Date: 2012-05-25

Citations: 5

DOI: https://doi.org/10.1090/s0002-9939-2012-11327-9

Abstract

Let $K$ be a number field with unit rank at least four, containing a subfield $M$ such that $K/M$ is Galois of degree at least four. We show 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 prove this unconditionally.

Locations

  • Proceedings of the American Mathematical Society - View - PDF
  • CiteSeer X (The Pennsylvania State University) - View - PDF

Similar Works

Action Title Year Authors
+ PDF Chat Euclidean Rings of Algebraic Integers 2004 Malcolm Harper
M. Ram Murty
+ Division of primitive Points in an abelian Variety 2022 Francesco Ballini
+ PDF Chat Euclidean ideal classes in Galois number fields of odd prime degree 2022 V. Kumar Murty
Jyothsnaa Sivaraman
+ Euclidean Arithmetic 2022 John Stillwell
+ Riemann hypothesis and finding roots over finite fields 1985 M-D A Huang
+ A family of number fields with unit rank at least 4 that has Euclidean ideals 2013 Hester Graves
M. Ram Murty
+ New techniques for computing the ideal class group and a system of fundamental units in number fields 2012 Jean-François Biasse
Claus Fieker
+ Fundamental Results and Algorithms in Dedekind Domains 2000 Henri Cohen
+ On ternary Diophantine equations of signature(p,p,2)over number fields 2020 Erman IŞIK
Yasemin Kara
Ekin Özman
+ Not having a Root in Number Fields is Diophantine 2016 Philip Dittmann
+ The Euclidean Algorithm 2023 Howard Karloff
+ Artin's Primitive Root Conjecture in Number Fields and For Matrices 2023 Noam Kimmel
+ Special Types of Domains 2018 Gregory T. Lee
+ Euclid 2003 Teo Mora
+ PROPERTIES OF EUCLIDEAN FIELDS 2020 K. Ranjith kumar
+ Computing a Gröbner basis of a polynomial ideal over a Euclidean domain 1988 Äbdelilah Kandri-Rody
Deepak Kapur
+ Foundations of Ring Arithmetic 2019 Stephanie N Reyes
+ Polynomial and Euclidean Rings 2003 William J. Gilbert
W. K. Nicholson
+ The Euclidean algorithm 2003 John Stillwell
+ Algebraic Number Theory for Beginners 2022 John Stillwell