The Prime times of twisted Diophantine approximation
Abstract
The seminal work of Kurzweil (1955) provides for any fixed badly approximable α and monotonically decreasing a Khintchine-type statement on the set of the inhomogeneous real parameters γ for which n α + γ ≤ (n) has infinitely many integer solutions, and further shows that the assumption of α being badly approximable is necessary. In this article, we generalize Kurzweil's statement to restricting n ∈ A, where A ⊂eq N is a set with some multiplicative structure. We show that for badly approximable α, the result of Kurzweil extends to a general class of sets A, which allows us to establish the Kurzweil-type result in particular along the primes and along the sums of two squares. Furthermore, we construct non-trivial sets A where the assumption of α being badly approximable is necessary. In particular, this criterion applies to A being the set of square-free numbers, providing a novel characterization of the badly approximable numbers. These statements in particular allow for improving the best known bounds for n α + γ ≤ (n) for infinitely many n ∈ A for fixed badly approximable α and for various sets A of number-theoretic interest when accepting an exceptional set for γ of Lebesgue measure 0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.