Small subsets with large sumset: Beyond the Cauchy--Davenport bound
Abstract
For a subset A of an abelian group G, given its size |A|, its doubling =|A+A|/|A|, and a parameter s which is small compared to |A|, we study the size of the largest sumset A+A' that can be guaranteed for a subset A' of A of size at most s. We show that a subset A'⊂eq A of size at most s can be found so that |A+A'| = ((1/3,s)|A|). Thus a sumset significantly larger than the Cauchy--Davenport bound can be guaranteed by a bounded size subset assuming that the doubling is large. Building up on the same ideas, we resolve a conjecture of Bollob\'as, Leader and Tiba that for subsets A,B of Zp of size at most α p for an appropriate constant α>0, one only needs three elements b1,b2,b3∈ B to guarantee |A+\b1,b2,b3\| |A|+|B|-1. Allowing the use of larger subsets A', we show that for sets A of bounded doubling, one only needs a subset A' with o(|A|) elements to guarantee that A+A'=A+A. We also address another conjecture and a question raised by Bollob\'as, Leader and Tiba on high-dimensional analogs and sets whose sumset cannot be saturated by a bounded size subset.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.