Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Non-Galois cubic fields which are Euclidean but not norm-Euclidean
HTML articles powered by AMS MathViewer

by David A. Clark PDF
Math. Comp. 65 (1996), 1675-1679 Request permission

Abstract:

Weinberger in 1973 has shown that under the Generalized Riemann Hypothesis for Dedekind zeta functions, an algebraic number field with infinite unit group is Euclidean if and only if it is a principal ideal domain. Using a method recently introduced by us, we give two examples of cubic fields which are Euclidean but not norm–Euclidean.
References
  • P. Hebroni, Sur les inverses des éléments dérivables dans un anneau abstrait, C. R. Acad. Sci. Paris 209 (1939), 285–287 (French). MR 14
  • D.A. Clark, The Euclidean algorithm for Galois extensions of the rational numbers, McGill University, Montréal, 1992.
  • David A. Clark, A quadratic field which is Euclidean but not norm-Euclidean, Manuscripta Math. 83 (1994), no. 3-4, 327–330. MR 1277533, DOI 10.1007/BF02567617
  • D.A. Clark and M.R. Murty, The Euclidean algorithm in Galois extensions of $\mathbb {Q}$, J. Reine Angew. Math. 459 (1995), 151–162.
  • F. Lemmermeyer, The Euclidean algorithm in algebraic number fields, Exposition. Math. 13 (1995), 385–416.
  • H.W. Lenstra, Lectures on Euclidean rings, Bielefeld, 1974.
  • J.R. Smith, The inhomogeneous minima of some totally real cubic fields, Computers in Number Theory (A.O.L. Atkin and B.J. Birch, eds.), Academic Press, New York, 1971, pp. 223–224.
  • Elizabeth M. Taylor, Euclid’s algorithm in cubic fields with complex conjugates, J. London Math. Soc. (2) 14 (1976), no. 1, 49–54. MR 419399, DOI 10.1112/jlms/s2-14.1.49
  • Peter J. Weinberger, On Euclidean rings of algebraic integers, Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972) Amer. Math. Soc., Providence, R.I., 1973, pp. 321–332. MR 0337902
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (1991): 11A05, 11R16
  • Retrieve articles in all journals with MSC (1991): 11A05, 11R16
Additional Information
  • David A. Clark
  • Affiliation: Department of Mathematics, Brigham Young University, Provo, Utah 84602
  • Email: clark@math.byu.edu
  • Received by editor(s): February 18, 1994
  • Received by editor(s) in revised form: April 15, 1995, August 11, 1994, and February 22, 1995
  • © Copyright 1996 American Mathematical Society
  • Journal: Math. Comp. 65 (1996), 1675-1679
  • MSC (1991): Primary 11A05; Secondary 11R16
  • DOI: https://doi.org/10.1090/S0025-5718-96-00764-8
  • MathSciNet review: 1355007