Limit theorems for counting large continued fraction digits
arXiv:1604.06612 · doi:10.1007/s10986-020-09479-5
Abstract
We establish a central limit theorem for counting large continued fraction digits , i.e. we count occurrences , where is a sequence of positive integers. Our result improves a similar result by Philipp which additionally assumes that tends to infinity. Moreover, we give a refinement of the famous Borel-Bernstein Theorem for continued fractions regarding the event that the -th continued fraction digit lies infinitely often between and for given sequences and . Also for these sets we obtain a central limit theorem. As an interesting side result we determine the first -mixing coefficient for the Gauss system explicitly.
arXiv comment14 pages
References in corpus (4)
- Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions
- A multifractal analysis for Stern-Brocot intervals, continued fractions and Diophantine growth rates
- Rigorous effective bounds on the Hausdorff dimension of continued fraction Cantor sets: a hundred decimal digits for the dimension of
- Upper and lower fast Khintchine spectra in continued fractions