Search arXivSearch

arXiv · 2309.12662

Hausdorff dimension of exceptional sets arising in $θ$-expansions

Abstract

For a fixed $θ^2=1/m$, $m \in \mathbb{N}_+$, let $x \in [0, θ)$ and $[a_1(x) θ, a_2(x) θ, \ldots]$ be the $θ$-expansion of $x$. Our first goal is to extend for $θ$-expansions the results of Jarnik \cite{J-1928} concerning the set of badly aproximable numbers and the set of irrationals whose partial quotients do not exceed a positive integer. Define $ L_n (x)= \displaystyle \max_{1 \leq i \leq n} a_i(x), x \in Ω:=[0, θ)\setminus \mathbb{Q} $. The second goal is to complete our result inspired by Philipp \cite{Ph-1976} % \[ \liminf_{n \to \infty} \frac{L_n(x) \log\log n}{n} = \frac{1}{\log \left( 1+ θ^2\right)} \mbox{ for a.e. } x \in [0, θ]. \] % In this regard we prove that for any $η> 0$ the set \[ E(η) = \left\lbrace x \in Ω: \lim_{n \to \infty} \frac{L_n(x) \log\log n}{n} = η\right\rbrace \] is of full Hausdorff dimension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gabriela Ileana Sebe, Dan Lascu. 2023-09-22. Hausdorff dimension of exceptional sets arising in $θ$-expansions. https://arxiv.org/abs/2309.12662

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