On Asymptotic Approximate Groups of Integers

preprint2016arXivOpen access

Abstract

Let rr be a positive integer, and let AA be a nonempty finite set of at least two integers. We let C~r(A)\tilde{C}_r(A) denote the {\em asymptotic rr-covering number} of AA, that is, the smallest integer value of ll for which, for all sufficiently large positive integers hh, the rhrh-fold sumset of AA is contained in at most ll translates of the hh-fold sumset of AA. Nathanson proved that C~r(A)\tilde{C}_r(A) is always at most r+1r+1; here we extend this result to prove that C~r(A)\tilde{C}_r(A) is always at least rr, and determine all sets AA for which C~r(A)=r\tilde{C}_r(A)=r.

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.