Number Systems Pertaining to Euclidean Rings of Imaginary Quadratic Integers
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
For a ring R of imaginary quadratic integers, using a concept of a unitary number system in place of the Motzkin's universal side divisor, we show that the following statements are equivalent: (1) R is Euclidean. (2) R has a unitary number system. (3) R is norm-Euclidean. Through an application of the above theorem we see that R admits binary or ternary number systems if and only if R is Euclidean.
Abstract
For a ring R of imaginary quadratic integers, using a concept of a unitary number system in place of the Motzkin's universal side divisor, we show that the following statements are equivalent: (1) R is Euclidean. (2) R has a unitary number system. (3) R is norm-Euclidean. Through an application of the above theorem we see that R admits binary or ternary number systems if and only if R is Euclidean.
참고문헌 (19)
- S. Akiyama, "A Survey on Topological Properties of Tiles Related to Number Systems", Geom. Dedica, 109, pp.89~105 (2004)
- O. A. Campoli, "A principal ideal domain that is not a Euclidean domain", Amer. Math. Monthly, 95(9), pp.868~871 (1988)
- K. Conrad, "Remarks about Euclidean domains, an expository paper in Ring Thery", ~
- K. Falconer, "Fractal Geometry, Mathematical Foundations and Applications" (1990), Wiley
- D. Goffnet, "Number systems with a complex base: a fractal tool for teaching topology", Amer. Math. Monthly, 98(3), pp.249255~ (1991)
- L. Guillen, "A principal ideal domain that is not a Euclidean domain, a personal note in website", ~
- K. Groechenig, "Multiresolution Analysis, Haar bases and self-similar tilings of Rn", IEEE Trans. Inform. Th, 38(2), pp.556~568 (1992)
- S.I. Khmelnik, "Specialized digital computer for operations with complex numbers", Questions of Radio Electronics, 12(2) (1964)
- S.I. Khmelnik, "Positional coding of complex numbers", Questions of Radio Electronics, 12(9) (1966)
- D.E. Knuth, "An Imaginary Number System", Communication of the ACM-3, (4) (1960)
- N. Koblitz, "CM-curves with good cryptographic properties, Advances in Cryptology-CRYPTO '91'", LNCS, 576, pp.279~287 (1992)
- T. Motzkin, "The Euclidean Algorithm", Bull. Amer. Math. Soc., 55, pp.1142~1146 (1949)
- W. Penney, "A "binary" system for complex numbers", JACM, 12, pp.247~248 (1965)
- A. Petho, "On a polynomial transformation and its application to the construction of a public key cryptosystem, Computational Number Theory", Proc., Walter de Gruyter Publ. Comp., pp.31~44 (1991)
- H.M. Stark, "A complete determination of the complex quadratic elds of class number one", Michigan Math. J, 14, pp.1~27 (1967)
- H. J. Song, "Disclike Lattice Reptiles induced by Exact Polyominos", Fractals, 7(1), pp.9~22 (1999)
- I. Stewart, "Algebraic Number Theory, Chapman and Hall Mathematics Series"
- K.S. Williams, "Note on non-Euclidean principal ideal domains", Amer. Math. Monthly, 48(3), pp.176~177 (1975)
- Jack C. Wilson, "A Principal Ring that is Not a Euclidean Ring", Math. Mag, 46, pp.34~38 (1973)
