A Lochs-Type Approach via Entropy in Comparing the Efficiency of Different Continued Fraction Algorithms
Keyword(s):
We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to compare the efficiency by describing the rate at which the digits of one number-theoretic expansion determine those of another. We study Chan’s continued fractions, θ-expansions, N-continued fractions, and Rényi-type continued fractions. A central role in fulfilling our goal is played by the entropy of the absolutely continuous invariant probability measures of the associated dynamical systems.
2009 ◽
Vol 29
(5)
◽
pp. 1451-1478
◽
2005 ◽
Vol 2005
(5)
◽
pp. 449-467
◽
2021 ◽
Vol 58
(2)
◽
pp. 230-245
2014 ◽
Vol 24
(08)
◽
pp. 1440008
2011 ◽
Vol 32
(2)
◽
pp. 739-761
◽
2008 ◽
Vol 28
(4)
◽
pp. 1117-1133
◽