Search arXivSearch

arXiv · 2105.11608

Metric results for numbers with multiple $q$-expansions

Abstract

Let $M$ be a positive integer and $q\in (1, M+1]$. A $q$-expansion of a real number $x$ is a sequence $(c_i)=c_1c_2\cdots$ with $c_i\in \{0,1,\ldots, M\}$ such that $x=\sum_{i=1}^{\infty}c_iq^{-i}$. In this paper we study the set $\mathcal{U}_q^j$ consisting of those real numbers having exactly $j$ $q$-expansions. Our main result is that for Lebesgue almost every $q\in (q_{KL}, M+1), $ we have $$\dim_{H}\mathcal{U}_{q}^{j}\leq \max\{0, 2\dim_H\mathcal{U}_q-1\}\text{ for all } j\in\{2,3,\ldots\}.$$ Here $q_{KL}$ is the Komornik-Loreti constant. As a corollary of this result, we show that for any $j\in\{2,3,\ldots\},$ the function mapping $q$ to $\dim_{H}\mathcal{U}_{q}^{j}$ is not continuous.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon Baker, Yuru Zou. 2021-05-25. Metric results for numbers with multiple $q$-expansions. https://arxiv.org/abs/2105.11608

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