On Asymptotic Approximate Groups of Integers
Abstract
Let r be a positive integer, and let A be a nonempty finite set of at least two integers. We let Cr(A) denote the asymptotic r-covering number of A, that is, the smallest integer value of l for which, for all sufficiently large positive integers h, the rh-fold sumset of A is contained in at most l translates of the h-fold sumset of A. Nathanson proved that Cr(A) is always at most r+1; here we extend this result to prove that Cr(A) is always at least r, and determine all sets A for which Cr(A)=r.
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.