Two asymptotic distributions related to Rényi-type continued fraction expansions (Q2678439)

As the authors state in Introduction, this paper completes a series of papers by the authors: [Acta Math. Hung. 160, No. 2, 292--313 (2020; Zbl 1440.11126)], [Acta Arith. 193, No. 3, 283--292 (2020; Zbl 1448.11133)], [Period. Math. Hung. 81, No. 2, 239--249 (2020; Zbl 1474.11128)].\par And, indeed, it is quite clear that ``the past is the basis for the present and opens the road to the future'' as can be seen from the fact that the first \(6\) pages of the paper restate the machinery of the three papers cited above. The main Propositions will be stated below, without going into the fine print of concepts and definitions. The authors prove among others:\par Proposition 3.1 For any \(f\in BV(I)\) we have \[\mathrm{var}\ U_N(f)\leq \frac{1}{N}\cdot \mathrm{var}\ f + K_N\cdot \vert f\vert ,\] where \[K_n=\frac{2}{2N-1+2\sqrt{N(N-1)}}.\] (here \(I=[0,1]\), \(U_N\) the Perron-Frobenius operator, \(N\geq 2\) a fixed integer). \par Proposition 4.1 For any \(t\in I\) and \(n\in\mathbb{N}_{+}\) we have \[\frac{1}{2}P_N^{N(n)}(1) \leq \sup_{y\in I}\ \vert \rho_N^t (s_{N,n}^t \in[0,y])-\rho_N([0,1])\vert ,\] with \(P_N^{N(n)}(t)=\sup_{s\in I}\ \rho_N^t(s_{N,n}^t=s)\), where we write \(N(n)\) for \((i_1,\ldots,i_n)\) with \(i_1=\cdots=i_n=N,\,n\in\mathbb{N}_{+}\).\par Proposition 4.2 (The lower bound) For any \(t\in I\) we have \[\frac{1}{2} P_N^{N(n)} (1)\] \[\leq \sup_{x,y\in I}\ \left\vert \rho_N^t (R_N^n\in [0,x],\ s_{N,n}^t \in [0,y])\right. \] \[\left.-\frac{1}{\log{\left(\frac{N}{N-1}\right)}}\log\frac{(x+N-1)(y+N-1)}{(N-1)(N-(1-x)(1-y))}\right\vert \] for all \(n\in\mathbb{N}_{+}\).\par Proposition 4.4 (The upper bound) For any \(t\in I\) we have \[\sup_{x,y\in I}\ \left\vert \rho_N^t (R_N^n\in [0,x],\ s_{N,n}^t \in [0,y]) -\frac{1}{\log{\left(\frac{N}{N-1}\right)}}\log\frac{(x+N-1)(y+N-1)}{(N-1)(N-(1-x)(1-y))}\right\vert \] \[\leq \left(\frac{1}{N}+k_N\right)^n \] for all \(n\in\mathbb{N}\), where \(K_n\) is as in Proposition 3.1.