Skip to main content
Log in

Convergence of continued fraction type algorithms and generators

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

Abstract

The concept of convergence of continued fraction type algorithms has been defined a number of times in the literature. We investigate the relation between these definitions, and show that they do not always coincide. We relate the definitions to the question whether or not the natural partition of the underlying dynamical system is a generator. It turns out that the ‘right’ definition of convergence is equivalent to this partition being a generator. The second definition of convergence is shown to be equivalent only under extra conditions on the transformation. These extra conditions are typically found to be satisfied when the second definition is used in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bernstein L (1971) The Jacobi-Perron Algorithm. Its Theory and Application. Lect Notes Math207: New York: Springer

    Google Scholar 

  2. Billingsley P (1965) Ergodic Theory and Information, New York: Wiley

    Google Scholar 

  3. Brentjes AJ (1981) multi-dimensional Continued Fraction Algorithms. Amsterdam: Math Centre

    Google Scholar 

  4. Ito S, Keane MS, Ohtsuki M (1993) Almost everywhere exponential convergence of the modified Jacobi-Perron algorithm. Ergodic Th and Dyn Sys13, 319–334

    Google Scholar 

  5. Kraaikamp C (1991) A new class of continued fractions. Acta ArithmeticaLVII, 1–39

    Google Scholar 

  6. Lagarias JC (1993) The quality of the diophantine approximations found by the Jacobi-Perron algorithm and related algorithms. Mh Math115: 299–328

    Google Scholar 

  7. Podsypanin EV (1977) A generalization of the algorithm for continued fractions related to the algorithm of Viggo Brunn. Studies in Number Theory (LOMI), 4. Zap Naucn Sem Leningrad Otdel Mat Inst Steklov67: 184–194. English translation: J Soviet Math16: 885–893 (1981)

    Google Scholar 

  8. Schweiger F (1973) The metrical theory of the Jacobi-Perron algorithm. Lect Notes Math334. Berlin Heidelberg New York: Springer

    Google Scholar 

  9. Schweiger F (1978) A modified Jacobi-Perron algorithm with explicitly given invariant measure. Lect Notes Math729. Berlin-Heidelberg New York: Springer

    Google Scholar 

  10. Schweiger F (1991) Invariant measures for maps of continued fraction type. J Number Theory39: 162–174

    Google Scholar 

  11. Schweiger F (1996) Multidimensional continued fractions. Preliminary version

  12. Yuri M (1986) On a Bernoulli property for multidimensional mapping with finite range structure. Tokyo J Math9: 457–485

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kraaikamp, C., Meester, R. Convergence of continued fraction type algorithms and generators. Monatshefte für Mathematik 125, 1–14 (1998). https://doi.org/10.1007/BF01489454

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01489454

1991 Mathematics Subject Classification

Key words

Navigation