Order

, Volume 32, Issue 2, pp 157–178 | Cite as

A Note on Euclidean Order Types

Article

Abstract

Euclidean functions with values in an arbitrary well-ordered set were first considered by Motzkin in 1949 and studied in more detail by Samuel and Nagata in the 1970’s and 1980’s. Here these results are revisited, simplified, and extended. The main themes are (i) consideration of Ord-valued functions on an Artinian poset and (ii) use of ordinal arithmetic, including the Hessenberg-Brookfield ordinal sum. To any Euclidean ring we associate an ordinal invariant, its Euclidean order type, and we initiate a study of this invariant, especially for Euclidean rings which are not domains.

Keywords

Euclidean ring Euclidean function Artinian ordered set Ordinal invariant 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brookfield, G.: The length of Noetherian modules. Comm. Algebra 30, 3177–3204 (2002)MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Fletcher, C.R.: Euclidean rings. J. London Math. Soc. 4, 79–82 (1971)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Gulliksen, T.H.: A theory of length for Noetherian modules, vol. 3 (1973)Google Scholar
  4. 4.
    Hessenberg, G.: Grundbegriffe der Mengenlehre Göttingen (1906)Google Scholar
  5. 5.
    Hiblot, J.-J.: Des anneaux euclidiens dont le plus petit algorithme n’est pas à valeurs finies. C. R. Acad. Sci. Paris Sér. A-B 281(12), Ai, A411–A414 (1975)MathSciNetGoogle Scholar
  6. 6.
    Hiblot, J.-J.: Correction à une note sur les anneaux euclidiens: Des anneaux euclidiens dont le plus petit algorithme n’est pas à valeurs finies. C. R. Acad. Sci. Paris Sér. A-B 281(12), A411–A414 (1975)MathSciNetGoogle Scholar
  7. 7.
    Hiblot, J.-J.C. R. Acad. Sci. Paris Sér. A-B 284(15), A847–A849 (1977)MathSciNetGoogle Scholar
  8. 8.
    Lenstra, H.W.: On Artin’s conjecture and Euclid’s algorithm in global fields. Invent. Math. 42, 201–224 (1977)MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Motzkin, T.: The Euclidean algorithm. Bull. Amer. Math. Soc. 55, 1142–1146 (1949)MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Nagata, M.: On Euclid algorithm. C. P. Ramanujama tribute, Tata Inst. Fund. Res Studies in Math., vol. 8, pp. 175–186. Springer, Berlin-New York (1978)Google Scholar
  11. 11.
    Nagata, M.: Some remarks on Euclid rings. J. Math. Kyoto Univ. 25, 421–422 (1985)MATHMathSciNetGoogle Scholar
  12. 12.
    Queen, C.: Arithmetic Euclidean rings. Acta Arith. 26, 105–113 (1974/75)MathSciNetGoogle Scholar
  13. 13.
    Samuel, P.: About Euclidean rings. J. Algebra 19, 282–301 (1971)MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    van der Waerden: Algebra Vol. 1. Based in part on lectures by E. Artin and E. Noether. In: Blum, F., Schulenberger,J.R. (eds.) Translated from the seventh German. Springer–Verlag, New York (1991)Google Scholar
  15. 15.
    Zariski, O., Samuel, P.: Commutative Algebra, vol. I. Van Nostrand, Princeton, New Jersey (1958)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Department of Mathematics, Boyd Graduate Studies Research CenterUniversity of GeorgiaAthensUSA

Personalised recommendations