Search arXivSearch

arXiv · 2509.23059

Convergence exponent of Dirichlet non-improvable numbers in the theory of continued fractions

Abstract

Let $x \in [0,1)$ be an irrational number with continued fraction expansion $[a_1(x),a_2(x), \cdots,a_n(x),\cdots]$ and $q_n(x)$ be the denominator of its $n$-th convergent. We establish, for any $α,β$ in $[0,+\infty]$, the Hausdorff dimension formula of the intersections of the sets of Dirichlet non-improvable numbers and the level set of convergent exponent, i.e. $$ G(α,β): =\left\{x\in[0,1)\colon τ(x)=α,\,\,\text{and} \,\, \limsup_{n\to\infty}\frac{\log (a_n(x)a_{n+1}(x))}{\log q_n(x)}\geqβ\right\}, $$ and $$ E(α,β): =\left\{x\in[0,1)\colon τ(x)=α,\,\,\text{and} \,\, \limsup_{n\to\infty}\frac{\log (a_n(x)a_{n+1}(x))}{\log q_n(x)}=β\right\}, $$ where $$ τ(x):= \inf\Big\{s \geq 0: \sum_{n \geq 1} a^{-s}_n(x)<\infty\Big\}. $$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoyan Tan, Zhenliang Zhang. 2025-09-27. Convergence exponent of Dirichlet non-improvable numbers in the theory of continued fractions. https://arxiv.org/abs/2509.23059

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

KEEP EXPLORING

Related papers

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

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