Advertisement

Shortest division chains in imaginary quadratic number fields

  • Heinrich Rolletschek
Algorithmic Number Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)

Abstract

Let O d be the set of algebraic integers in an imaginary quadratic number field Q[√d], d<0, where d is the discriminant of O d . Consider the Euclidean Algorithm (EA), applied to algebraic integers ξ, ηO d . It consists in computing a sequence of remainders ρ0=ξ, ρ1=η, ρ2, ..., ρn+1=0, where ρi+1=ρi−1γ i ρ i for algebraic integers γ i K, i=1, ..., n. We show that except for d=−11 the number of divisions to be carried out is always minimized by choosing each γ i such that N(ρi-1 - γ i ρ i ), the norm of γi-1 - γ i ρ i , is minimal. This result has been proven previously in special cases. It also applies to those imaginary quadratic number rings which are not Euclidean; in this case the division chains may be infinite. For d=−7, −8 the methods applied so far must be modified somewhat, and for d=−11 we provide a counterexample and a theorem which partially answers the question, how shortest division chains can be obtained.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Caviness, B. F., Collins, G. E.: Algorithms for Gaussian integer arithmetic. In: Proceedings of the 1976 Symposium on Symbolic and Algebraic Computation, edited by R. E. Jenks. Association for Computing Machinery Inc., 36–45 (1976).Google Scholar
  2. [2]
    Cooke, George E.: A weakening of the Euclidean property for integral domains and applications to algebraic number theory. J. reine angew. Math. 282, 133–156 (1976).Google Scholar
  3. [3]
    Hasse, H.: Vorlesungen über Zahlentheorie. Springer Verlag, Berlin 1964.Google Scholar
  4. [4]
    Kaltofen, E., Rolletschek, H.: Arithmetic in quadratic fields with unique factorization. In: Proceedings of the EUROCAL '85 Conference on Computer Algebra, edited by B. F. Caviness. Springer Lec. Notes Comp. Sci. 204, 279–288 (1985).Google Scholar
  5. [5]
    Lazard, D.: Le meilleur algorithme d'Euclide pour K[X] et Z. Comptes Rendus Acad. Sci. Paris 284, 1–4 (1977).Google Scholar
  6. [6]
    Lazard, D.: Private communication.Google Scholar
  7. [7]
    Rolletschek, H.: On the number of divisions of the Euclidean algorithm applied to Gaussian integers. J. Symbolic Computation 2, 261–291 (1986).Google Scholar
  8. [8]
    Samuel, P.: About Euclidean rings. J. Algebra 19, 282–301 (1971).Google Scholar
  9. [9]
    Stark, H.: A complete determination of complex quadratic fields of class number one. Mich. Math. J. 17, 1–27 (1967).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Heinrich Rolletschek
    • 1
  1. 1.Department of MathematicsKent State UniversityKent

Personalised recommendations