Large sumsets from small subsets
Bela Bollobas, Imre Leader, Marius Tiba

TL;DR
This paper explores how small subsets can generate large sumsets in additive combinatorics, revealing that under certain conditions, small subsets can produce sumsets close to the classical lower bounds.
Contribution
It introduces new results demonstrating that small subsets can form sumsets nearly reaching the Cauchy--Davenport lower bound, advancing understanding of sumset size limitations.
Findings
Small subsets can produce sumsets close to the Cauchy--Davenport bound
Under certain conditions, exact sumset bounds are achievable with small subsets
The results extend classical additive combinatorics by considering subset size restrictions
Abstract
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and this is just one example of a large family of results. Our aim in this paper is to investigate what happens if we restrict the number of elements of one set that we may use to form the sums. Here is the question we set out to answer: given two subsets, A and B, does B have a subset C of bounded size such that A+C is large, perhaps even comparable to the size of A+B? In particular, can we get close to the lower bound of the Cauchy--Davenport theorem? Our main results show that, rather surprisingly, in many circumstances it is possible to obtain not merely an asymptotic version of the usual sumset bound, but even the exact bound itself.
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 · Advanced Topology and Set Theory · Analytic Number Theory Research
