Explicit sumset sizes in additive number theory

Abstract

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set RZ(h,k)= \|hA|:A ⊂eq Z and |A|=k\ for all integers h ≥ 3 and k ≥ 3. This paper constructs certain infinite families of finite sets of size k and computes their h-fold sumset sizes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…