Inhomogeneous Littlewood-type counting conjecture for inhomogeneously badly approximable numbers

Let αK\alpha\in\mathcal K and γ,δR\gamma,\delta\in\mathbb R, and let

Bad(δ)={βR:lim infnnnβδ>0}.\operatorname{Bad}(\delta)=\{\beta\in\mathbb R:\liminf_{n\to\infty}n\|n\beta-\delta\|>0\}.

For the counting assertion, write

#{n[N]:nnαγnβδ1/logn}loglogN.\#\{n\in[N]:n\|n\alpha-\gamma\|\,\|n\beta-\delta\|\leqslant 1/\log n\}\gg\log\log N.

Inhomogeneous Littlewood-type counting conjecture. There exists G=G(α,γ,δ)Bad(δ)G=G(\alpha,\gamma,\delta)\subseteq\operatorname{Bad}(\delta) with Hausdorff dimension

dimH(G)=1\mathrm{dim}_{\mathrm H}(\mathcal G)=1

such that every βG\beta\in\mathcal G satisfies the counting assertion for large NNN\in\mathbb N. This is posed as a desirable strengthening involving numbers that are badly approximable in an inhomogeneous sense. The supplied text does not establish whether this conjectural statement is open or resolved.

Sources & referencesView supporting material

Primary source

Sam Chow and Agamemnon Zafeiropoulos, “Fully Inhomogeneous Multiplicative Diophantine Approximation of Badly Approximable Numbers”, arXiv:2103.03605 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.