Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
A fundamental challenge within the metric theory of continued fractions involves quantifying sets of real numbers especially when their partial quotients exhibit specific growth rates. For any positive function Φ, the Wang–Wu theorem (2008) comprehensively describes the Hausdorff dimension of the set E 1 ( Φ ) : = { x ∈ [ 0 , 1 ) : a n ( x ) ≥ Φ ( n ) for infinitely many n ∈ N } . \mathcal{E}_{1}(\Phi):=\{x\in[0,1):a_{n}(x)\geq\Phi(n)\ \text{for infinitely many}\ n\in\mathbb{N}\}. Various generalisations of this set exist, such as substituting one partial quotient with the product of consecutive partial quotients in the aforementioned set which has connections with the improvements to Dirichlet’s theorem, and many other sets of similar nature. Establishing the upper bound of the Hausdorff dimension of such sets is significantly easier than proving the lower bound. In this paper, we present a unified approach to get an optimal lower bound for many known setups, including results by Wang–Wu [Adv. Math. (2008)], Huang–Wu–Xu [Israel J. Math. (2020)], Tan–Zhou [Nonlinearity (2023)], and several others. We also provide a new theorem derived as an application of our main result. We do this by finding an exact Hausdorff dimension of the set S m ( A 0 , … , A m − 1 ) = def { x ∈ [ 0 , 1 ) : c i A i n ≤ a n + i ( x ) < 2 c i A i n , 0 ≤ i ≤ m − 1 , for infinitely many n ∈ N } , S_{m}(A_{0},\ldots,A_{m-1})\overset{\mathrm{def}}{=}\{x\in[0,1):c_{i}A_{i}^{n}\leq a_{n+i}(x)<2c_{i}A_{i}^{n},\,0\leq i\leq m-1,\,\text{for infinitely many}\ n\in\mathbb{N}\}, where each partial quotient grows exponentially and the base is given by a parameter A i > 1 A_{i}>1 . For proper choices of A i A_{i} , this set serves as a subset for sets under consideration, providing an optimal lower bound of Hausdorff dimension in all of them. The crux of the proof lies in introducing multiple probability measures consistently distributed over the Cantor-type subset of S m ( A 0 , … , A m − 1 ) S_{m}(A_{0},\ldots,A_{m-1}) .
A fundamental challenge within the metric theory of continued fractions involves quantifying sets of real numbers especially when their partial quotients exhibit specific growth rates. For any positive function Φ, the Wang–Wu theorem (2008) comprehensively describes the Hausdorff dimension of the set E 1 ( Φ ) : = { x ∈ [ 0 , 1 ) : a n ( x ) ≥ Φ ( n ) for infinitely many n ∈ N } . \mathcal{E}_{1}(\Phi):=\{x\in[0,1):a_{n}(x)\geq\Phi(n)\ \text{for infinitely many}\ n\in\mathbb{N}\}. Various generalisations of this set exist, such as substituting one partial quotient with the product of consecutive partial quotients in the aforementioned set which has connections with the improvements to Dirichlet’s theorem, and many other sets of similar nature. Establishing the upper bound of the Hausdorff dimension of such sets is significantly easier than proving the lower bound. In this paper, we present a unified approach to get an optimal lower bound for many known setups, including results by Wang–Wu [Adv. Math. (2008)], Huang–Wu–Xu [Israel J. Math. (2020)], Tan–Zhou [Nonlinearity (2023)], and several others. We also provide a new theorem derived as an application of our main result. We do this by finding an exact Hausdorff dimension of the set S m ( A 0 , … , A m − 1 ) = def { x ∈ [ 0 , 1 ) : c i A i n ≤ a n + i ( x ) < 2 c i A i n , 0 ≤ i ≤ m − 1 , for infinitely many n ∈ N } , S_{m}(A_{0},\ldots,A_{m-1})\overset{\mathrm{def}}{=}\{x\in[0,1):c_{i}A_{i}^{n}\leq a_{n+i}(x)<2c_{i}A_{i}^{n},\,0\leq i\leq m-1,\,\text{for infinitely many}\ n\in\mathbb{N}\}, where each partial quotient grows exponentially and the base is given by a parameter A i > 1 A_{i}>1 . For proper choices of A i A_{i} , this set serves as a subset for sets under consideration, providing an optimal lower bound of Hausdorff dimension in all of them. The crux of the proof lies in introducing multiple probability measures consistently distributed over the Cantor-type subset of S m ( A 0 , … , A m − 1 ) S_{m}(A_{0},\ldots,A_{m-1}) .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.