The Cardinality of Sumsets: Different Summands
Brendan Murphy, Eyvindur Ari Palsson, Giorgis Petridis

TL;DR
This paper establishes upper bounds on the size of sumsets involving multiple summands in a commutative group, providing extremal examples that show the bounds are nearly optimal across all parameters.
Contribution
It introduces new bounds for the cardinality of sumsets with multiple summands and constructs extremal examples demonstrating the bounds' sharpness.
Findings
Derived upper bounds for |A+B_1+...+B_h| in terms of individual set sizes.
Provided extremal examples confirming the bounds are asymptotically sharp.
Extended understanding of sumset cardinalities in additive combinatorics.
Abstract
Let be a positive integer and be finite sets in a commutative group. We bound from above in terms of and . Extremal examples, which demonstrate that the bound is asymptotically sharp in all the parameters, are furthermore provided.
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.
