Relative sizes of iterated sumsets
Noah Kravitz

TL;DR
This paper constructs finite subsets of integers with prescribed relative sizes of their iterated sumsets, resolving a problem of Nathanson and extending to other abelian groups and equality conditions.
Contribution
It provides a method to realize any prescribed order of sumset sizes across multiple subsets and iterated sums, solving Nathanson's problem and generalizing to broader settings.
Findings
Existence of subsets with prescribed sumset size orderings
Extension to arbitrary infinite abelian groups
Ability to specify equalities among sumset sizes
Abstract
Let denote the -fold sumset of a subset of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations , there exist finite subsets such that for each , the relative order of the quantities is given by . We also establish extensions where is replaced by any other infinite abelian group or where one prescribes some equalities (not only inequalities) among the sumset sizes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Functional Equations Stability Results
