2000 character limit reached
Dispersion and Littlewood's conjecture (2307.14871v1)
Published 27 Jul 2023 in math.NT
Abstract: Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$ for which [ n \Vert n\alpha - \gamma \Vert \cdot \Vert n\beta - \delta \Vert < \frac{(\log \log n){3 + \varepsilon}}{\log n}. ] This is a significant quantitative improvement over a result of the first author and Zafeiropoulos. We show, moreover, that the exceptional set of $\beta$ has Fourier dimension zero, alongside further applications to badly approximable numbers and to lacunary diophantine approximation. Our method relies on a dispersion estimate and the Three Distance Theorem.