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, and Na is a nearest neighbour to a.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.