Metrical and ergodic theory of continued fraction algorithms (Q7013472)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8010251
Language Label Description Also known as
default for all languages
No label defined
    English
    Metrical and ergodic theory of continued fraction algorithms
    scientific article; zbMATH DE number 8010251

      Statements

      Metrical and ergodic theory of continued fraction algorithms (English)
      0 references
      0 references
      0 references
      12 March 2025
      0 references
      The authors wrote many papers on the metric theory of continued fractions in the last twenty years. This monograph is a synthesis of their work. In particular they study three kinds of continued fractions, namely \(\theta\)-continued fractions, \(N\)-continued fractions, and generalized Rényi continued fractions. After a general introduction, the authors study in detail each of these families (basic metric properties, associated dynamical system and its properties, Gauss-Kuzmin-like theorem, etc.). The last chapter is devoted to comparing the ``efficiency'' of these continued fraction algorithms (à la Lochs, i.e., how many generalized partial quotients are needed to obtain the first \(k\) decimal digits of a real in the unit interval). The book is well-written, it is reasonably easy to read. Furthermore it contains a useful list of 76 references. All this makes this book a must-read for mathematicians working in (or curious about) this field.
      0 references
      continued fraction algorithms
      0 references
      metric theory
      0 references
      ergodic theory
      0 references
      Gauss-Kuzmin theorems
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references