On a lower bound of the number of integers in Littlewood's conjecture

Abstract

We show that, for any $0<\gamma <1/2$, any $(\alpha ,\beta )\in {\mathbb{R}}^2$ except on a set with Hausdorff dimension about $\sqrt{\gamma }$, any small $0<\epsilon <1$ and any large $N\in \mathbb{N}$, the number of integers $n\in [1,N]$ such that $n⟨n\alpha ⟩⟨n\beta ⟩<\epsilon$ is greater than $\gamma \epsilon \log N$ up to a uniform constant. This can be seen as a quantitative result on the fact that the exceptional set to Littlewood's conjecture has Hausdorff dimension zero, obtained by M. Einsiedler, A. Katok and E. Lindenstrauss in 2000's. For the proof, we study the behavior of the empirical measures with respect to the diagonal action on $\mathrm{SL}(3,\mathbb{R})/\mathrm{SL}(3,\mathbb{Z})$ and show that we can obtain a quantitative result on Littlewood's conjecture for $(\alpha ,\beta )$ if the corresponding empirical measures are well-behaved. We also estimate Hausdorff dimension of the exceptional set to be small.

Some typos are corrected and abstract is rewritten