On Nathanson's Triangular Number Phenomenon
Kevin O'Bryant

TL;DR
This paper links the early growth of sumset sizes of finite integer sets to lattice minima, explaining the appearance of triangular numbers through combinatorial formulas and geometric interpretations.
Contribution
It introduces a geometric framework connecting sumset sizes to lattice minima, providing a new explanation for the occurrence of triangular numbers in sumset sequences.
Findings
Sumset sizes follow binomial coefficient formulas based on lattice minima.
Early sumset sizes are characterized by simple combinatorial expressions.
Triangular numbers emerge naturally from the geometric interpretation of sumsets.
Abstract
For a finite set , the -fold sumset is . We interpret the beginning of the sequence of sumset sizes in terms of the successive -minima of a lattice (specifically, the points in whose coordinates sum to 0 and which are perpendicular to ). In particular, if are the first and second minima, and , then , while if , then . This explains the appearance of triangular numbers in the sequence of sumset sizes, an observation related to a recent experiment of Nathanson.
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
TopicsAdvanced Mathematical Theories · Mathematics and Applications · Advanced Mathematical Theories and Applications
