Search arXivSearch

arXiv · 2004.05929

On the metric theory of inhomogeneous Diophantine approximation: An Erdős-Vaaler type result

Abstract

In 1958, Szüsz proved an inhomogeneous version of Khintchine's theorem on Diophantine approximation. Szüsz's theorem states that for any non-increasing approximation function $ψ:\mathbb{N}\to (0,1/2)$ with $\sum_q ψ(q)=\infty$ and any number $γ,$ the following set \[ W(ψ,γ)=\{x\in [0,1]: |qx-p-γ|< ψ(q) \text{ for infinitely many } q,p\in\mathbb{N}\} \] has full Lebesgue measure. Since then, there are very few results in relaxing the monotonicity condition. In this paper, we show that if $γ$ is can not be approximate by rational numbers too well, then the monotonicity condition can be replaced by the upper bound condition $ψ(q)=O((q(\log\log q)^2)^{-1}).$ In particular, this covers the case when $γ$ is not Liouville, for example $π,e,\ln 2, \sqrt{2}.$ In general, if $γ$ is irrational, $ψ(q)=O(q^{-1}(\log\log q)^{-2})$ and in addition, \[ \left(\liminf_{Q\to\infty} \sum_{q=Q}^{Q^{(\log Q)^{1/8} }}ψ(q)\right)=\infty, \] then $W(ψ,γ)$ has full Lebesgue measure. Our proof is based on a quantitative study of the discrepancy for irrational rotations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Han Yu. 2021-02-26. On the metric theory of inhomogeneous Diophantine approximation: An Erdős-Vaaler type result. https://doi.org/10.1016/j.jnt.2021.01.012

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