Gaps between fractional parts, and additive combinatorics
Number Theory
2014-10-31 v1
Abstract
We give bounds on the number of distinct differences as varies over all elements of a given finite set , and is a nearest neighbour to .
Cite
@article{arxiv.1410.8404,
title = {Gaps between fractional parts, and additive combinatorics},
author = {Antal Balog and Andrew Granville and Jozsef Solymosi},
journal= {arXiv preprint arXiv:1410.8404},
year = {2014}
}