Search arXivSearch

arXiv · 2310.01947

The dimension of the set of $ψ$-badly approximable points in all ambient dimensions; on a question of Beresnevich and Velani

Abstract

Let $ψ:\mathbb{N} \to [0,\infty)$, $ψ(q)=q^{-(1+τ)}$ and let $ψ$-badly approximable points be those vectors in $\mathbb{R}^{d}$ that are $ψ$-well approximable, but not $cψ$-well approximable for arbitrarily small constants $c>0$. We establish that the $ψ$-badly approximable points have the Hausdorff dimension of the $ψ$-well approximable points, the dimension taking the value $(d+1)/(τ+1)$ familiar from theorems of Besicovitch and Jarník. The method of proof is an entirely new take on the Mass Transference Principle by Beresnevich and Velani (Annals, 2006); namely, we use the colloquially named `delayed pruning' to construct a sufficiently large $\liminf$ set and combine this with ideas inspired by the proof of the Mass Transference Principle to find a large $\limsup$ subset of the $\liminf$ set. Our results are a generalisation of some $1$-dimensional results due to Bugeaud and Moreira (Acta Arith, 2011), but our method of proof is nothing alike.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henna Koivusalo, Jason Levesley, Benjamin Ward, Xintian Zhang. 2023-10-03. The dimension of the set of $ψ$-badly approximable points in all ambient dimensions; on a question of Beresnevich and Velani. https://arxiv.org/abs/2310.01947

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