Diophantine approximation with mild divisibility constraints
Dirichlet's theorem on Diophantine approximation states that for any real \(\alpha\) and any \(N \geq 1\), there exists an integer \(n\) such that \(1 \leq n \leq N\) and \(\| n\alpha \| < N^{-1}\); here \(\| \cdot \| \) is the distance to the nearest integer function. There is a long history of estimates for \(\| n\alpha \| \) when \(n\) is subject to various arithmetic restrictions. In this paper the authors establish several theorems that deal with \(\| n\alpha \| \) when \(n\) is \textit{\(\mathcal B\)-free}. Let \({\mathcal B} = (b_k)\) be an increasing sequence of natural numbers such that \(\sum b_k^{-1} < \infty\) and \((b_k, b_m) = 1\) when \(k \neq m\). An integer \(n\) is called \(\mathcal B\)-free if it is not divisible by any element of \(\mathcal B\). Two of the main results of the paper can be stated as follows. Theorem 1. For any irrational real \(\alpha\), any real \(\beta\), any sequence \(\mathcal B\) as above, and any \(\epsilon > 0\), there are infinitely many solutions to the inequality \(\| n\alpha + \beta \| < n^{-1/3 + \epsilon}\) in \(\mathcal B\)-free integers \(n\) having exactly two prime factors. Theorem 2. For any positive integer \(r\), there exist an irrational real \(\alpha\) and a sequence \(\mathcal B\) as above, such that \(\| n\alpha \| > n^{-1}(\log n)^r\) for all sufficiently large \(\mathcal B\)-free integers \(n\).
- \(B\)-free numbers in short arithmetic progressions
- Diophantine approximation with square-free numbers
- scientific article; zbMATH DE number 3950629 (Why is no real title available?)
- scientific article; zbMATH DE number 3563248 (Why is no real title available?)
- scientific article; zbMATH DE number 1267537 (Why is no real title available?)
- scientific article; zbMATH DE number 1151373 (Why is no real title available?)
- Integers without large prime factors
- Khintchine's problem in metric diophantine approximation
- Multiple exponential sums with monomials and their applications in number theory
- Nombres
- Nonvanishing of Fourier coefficients of modular forms
- Nonvanishing of Fourier coefficients of newforms in progressions
- Number of \(\mathcal B\)-free numbers in short intervals
- Numbers badly approximate by fractions with prime denominator
- On a problem of Erdős and Szemerédi
- On Gaps Between Squarefree Numbers II
- On the difference of consecutive terms of sequences defined by divisibility properties
- On the difference of consecutive terms of sequences defined by divisibility properties, II
- On the distribution of the convergents of almost all real numbers
- On the metric theory of diophantine approximation
- On the Sizes of Gaps in the Fourier Expansion of Modular Forms
- Small values of n^ 2 1
- The Chebotarev density theorem in short intervals and some questions of Serre
- The distribution of p modulo one
- The distribution of spacings between the fractional parts of \(n^2\alpha\)
- The large sieve
- The square sieve and consecutive square-free numbers
- Trigonometric sums over primes II
- Approximating reals by sums of two rationals
- On the distribution of B-free numbers and non-vanishing Fourier coefficients of cusp forms
- Diophantine approximation with arithmetic functions, I
- Pair correlation of rationals with prime denominators
- Metric number theory of Fourier coefficients of modular forms
- Diophantine approximation with products of two primes
- Diophantine approximation with smooth numbers
- Metric number theory of Fourier coefficients of Hilbert modular forms
This page was built for publication: Diophantine approximation with mild divisibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493048)
