Bohr sets and multiplicative Diophantine approximation (Q1653120)

From MaRDI portal
Revision as of 03:15, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bohr sets and multiplicative Diophantine approximation
scientific article

    Statements

    Bohr sets and multiplicative Diophantine approximation (English)
    0 references
    0 references
    17 July 2018
    0 references
    According to [\textit{P. Gallagher}, J. Lond. Math. Soc. 37, 387--390 (1962; Zbl 0124.02902)], for almost all pairs \((\alpha,\beta)\in{\mathbb{R}}\times{\mathbb{R}}\), the inequality \[ \liminf_{n\to\infty} n(\log n)^2\| n\alpha\| \cdot \| n\beta\| =0 \] is valid. The author considers inhomogeneous versions of this result. He proves that if \(\alpha\) and \(\gamma\) are two real numbers with \(\alpha\) irrational and not Liouville and \(\Psi:{\mathbb{N}}\rightarrow {\mathbb{R}}_{\geq 0}\) a decreasing function such that \(\sum_{n\geq 1} \Psi(n)\log n=\infty\), then for almost all \(\beta\in{\mathbb{R}}\) there exist infinitely many \(n\in{\mathbb{N}}\) such that \[ \| n\alpha-\gamma\| \cdot \| n\beta\| <\Psi(n), \] where \(\|\cdot\|\) denotes the distance to the nearest integer. As a consequence, for almost all \(\beta\in{\mathbb{R}}\), we have \[ \liminf_{n\to\infty} n(\log n)^2\| n\alpha-\gamma\| \cdot \| n\beta\| =0. \] This corollary was proved conditionally in [\textit{V. Beresnevich} et al., ``Sums of reciprocals of fractional parts and multiplicative Diophantine approximation'', Preprint, \url{arXiv:1511.06862}] assuming the Duffin-Schaeffer Conjecture [\textit{R. J. Duffin} and \textit{A. C. Schaeffer}, Duke Math. J. 8, 243--255 (1941; Zbl 0025.11002)] namely: let \(\Psi:{\mathbb{N}}\to {\mathbb{R}}_{\geq 0}\) satisfy \[ \sum_{n\geq 1} \frac{\varphi(n)}{n}\Phi(n)=\infty, \] where \(\varphi\) is Euler totient function. Then for almost all \(\beta\in{\mathbb{R}}\) the inequality \[ \| n\beta -r\| <\Phi(n) \] holds for infinitely many coprime pairs \((n,r)\in{\mathbb{N}}\times {\mathbb{Z}}\). Here the author uses the inhomogeneous Duffin-Schaeffer theorem, which states that under the same assumption on \(\Phi\), if, moreover, \[ \limsup_{N\to \infty} \left( \sum_{ 1\leq n\leq N} \frac{\varphi(n)}{n}\Phi(n)\right) \left( \sum_{ 1\leq n\leq N} \Phi(n)\right)^{-1}>0, \] then the conclusion of the Duffin-Schaeffer Conjecture holds. The idea of the proof is to find large generalized arithmetic progressions within inhomogeneous Bohr sets, extending a construction given by \textit{T.~Tao} [``Continued fractions, Bohr sets and the Littlewood conjecture'', Preprint].
    0 references
    Littlewood's conjecture
    0 references
    Duffin-Schaeffer conjecture
    0 references
    Duffin-Schaeffer theorem
    0 references
    inhomogeneous Diophantine approximation
    0 references
    Bohr sets
    0 references
    multiplicative Diophantine approximation
    0 references
    Gallagher's Theorem
    0 references
    Liouville numbers
    0 references
    metric number theory
    0 references
    badly approximable numbers
    0 references
    additive combinatorics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references