Limit theorems for counting large continued fraction digits (Q779822): Difference between revisions

The authors give the following brief description of the present research: ``We establish a central limit theorem for counting large continued fraction digits \((a_n)\), that is, we count occurrences \(\{a_n > b_n\}\), where \((b_n)\) is a sequence of positive integers. Our result improves a similar result by Philipp, which additionally assumes that \(b_n\) tends to infinity. Moreover, we give a refinement of the famous Borel-Bernstein theorem for continued fractions regarding the event that the nth continued fraction digit lies infinitely often between \(d_n\) and \(d_n(1 + 1/c_n)\) for given sequences \((c_n)\) and \((d_n)\). Also, for these sets, we obtain a central limit theorem. As an interesting side result, we explicitly determine the first \(\phi\)-mixing coefficient for the Gauss system.'' The techniques used for proving the main results are explained in detail and some auxiliary notions are introduced. The classical notion of \(\phi\)- and \(\psi\)-mixing is given. To prove the main results, the necessary mixing properties of the continued fractions digits are described. The relationships between presented (main and auxiliary) results and known results of other researchers are considered.