Gaps between fractional parts, and additive combinatorics
classification
🧮 math.NT
keywords
additiveboundscombinatoricsdifferencesdistinctelementsfinitefractional
read the original abstract
We give bounds on the number of distinct differences $N_a-a$ as $a$ varies over all elements of a given finite set $A$, and $N_a$ is a nearest neighbour to $a$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.