Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.00521

Fractal geometry of continued fractions with large coefficients and dimension drop problems

Lulu Fang·Carlos Gustavo Moreira·Yiwei Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1928, Jarn\'ık \cite{Jar} obtained that the set of continued fractions with bounded coefficients has Hausdorff dimension one. Good \cite{Goo} observed a dimension drop phenomenon by proving that the Hausdorff dimension of the set of continued fractions whose coefficients tend to infinity is one-half. For the set of continued fractions whose coefficients tend to infinity rapidly, Luczak \cite{Luc} and Feng et al. \cite{FWLT} showed that its Hausdorff dimension decreases even further. Recently, Liao and Rams \cite{LR16} also observed an analogous dimension drop phenomenon when they studied the subexponential growth rate of the sum of coefficients. In this paper, we consolidate and considerably extend the studies of the abovementioned problem into a general dimension drop problem on the distribution of continued fractions with large coefficients. As applications, we use a different approach to reprove a result of Wang and Wu on the dimensions of the Borel-Bernstein sets \cite{WW}, fulfil the dimension gap proposed by Liao and Rams \cite{LR16}, and establish several new results concerning the dimension theory of liminf and limsup sets related to the maximum of coefficients.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lulu Fang, Carlos Gustavo Moreira, Yiwei Zhang. 2024-08-31. Fractal geometry of continued fractions with large coefficients and dimension drop problems. https://arxiv.org/abs/2409.00521

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗