research

Gaps between fractional parts, and additive combinatorics

Abstract

We give bounds on the number of distinct differences Na - a as a varies over all elements of a given finite set A ⊆ (ℝ/ℤ), d ≥ 1 and Na is a nearest neighbour to a

    Similar works