Inverse problems for sumset sizes of finite sets of integers
Melvyn B. Nathanson

TL;DR
This paper explores the properties and relationships of sumset sizes of finite integer sets, focusing on their growth, configurations, and differences for affinely inequivalent sets.
Contribution
It introduces new insights into the behavior and comparison of sumset size sequences for finite integer sets, including their growth rates and structural differences.
Findings
Characterization of sumset size sequences
Relations between sumset sequences of inequivalent sets
Analysis of growth rates and configurations
Abstract
Let be a finite set of integers and let be its -fold sumset. This paper investigates the sequence of sumset sizes , the relations between these sequences for affinely inequivalent sets and , and the comparative growth rates and configurations of the sumset size sequences and .
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
