Inhomogeneous Littlewood-type counting conjecture for inhomogeneously badly approximable numbers

About 5 years old · traced to

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

Bad⁡(δ)={β∈R:lim inf⁡n→∞n∥nβ−δ∥>0}.\operatorname{Bad}(\delta)=\{\beta\in\mathbb R:\liminf_{n\to\infty}n\|n\beta-\delta\|>0\}.

For the counting assertion, write

#{n∈[N]:n∥nα−γ∥ ∥nβ−δ∥⩽1/log⁡n}≫log⁡log⁡N.\#\{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 N∈NN\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.

References

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.