Gaps between fractional parts, and additive combinatorics

preprint2014arXivOpen access

Abstract

We give bounds on the number of distinct differences Na−aN_a-a as aa varies over all elements of a given finite set AA, and NaN_a is a nearest neighbour to aa.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.