English

Dispersion and Littlewood's conjecture

Number Theory 2023-07-28 v1

Abstract

Let ε>0\varepsilon>0. We construct an explicit, full-measure set of α[0,1]\alpha \in[0,1] such that if γR\gamma \in \mathbb{R} then, for almost all β[0,1]\beta \in[0,1], if δR\delta \in \mathbb{R} then there are infinitely many integers n1n\geq 1 for which nnαγnβδ<(loglogn)3+εlogn. 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.

Keywords

Cite

@article{arxiv.2307.14871,
  title  = {Dispersion and Littlewood's conjecture},
  author = {Sam Chow and Niclas Technau},
  journal= {arXiv preprint arXiv:2307.14871},
  year   = {2023}
}
R2 v1 2026-06-28T11:41:52.054Z