Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On a lower bound of the number of integers in Littlewood's conjecture (2207.13462v2)

Published 27 Jul 2022 in math.NT and math.DS

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<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such that $n\langle n\alpha\rangle\langle n\beta\rangle<\varepsilon$ is greater than $\gamma\varepsilon\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 $\rm{SL}(3,\mathbb{R})/\rm{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.

Summary

We haven't generated a summary for this paper yet.