On the size and structure of t-representable sumsets

Abstract

Let A⊂eq Z≥ 0 be a finite set with minimum element 0, maximum element m, and elements strictly in between. Write (hA)(t) for the set of integers that can be written in at least t ways as a sum of h elements of A. We prove that (hA)(t) is "structured" for \[ h ≥ (1+o(1)) 1e m t1/ \] (as ∞, t1/ ∞), and prove a similar theorem on the size and structure of A⊂eq Zd for h sufficiently large. Moreover, we construct a family of sets A = A(m,,t)⊂eq Z≥ 0 for which (hA)(t) is not structured for h m t1/.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…