English

Small subsets with large sumset: Beyond the Cauchy--Davenport bound

Combinatorics 2022-10-14 v1 Number Theory

Abstract

For a subset AA of an abelian group GG, given its size A|A|, its doubling κ=A+A/A\kappa=|A+A|/|A|, and a parameter ss which is small compared to A|A|, we study the size of the largest sumset A+AA+A' that can be guaranteed for a subset AA' of AA of size at most ss. We show that a subset AAA'\subseteq A of size at most ss can be found so that A+A=Ω(min(κ1/3,s)A)|A+A'| = \Omega(\min(\kappa^{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 κ\kappa is large. Building up on the same ideas, we resolve a conjecture of Bollob\'as, Leader and Tiba that for subsets A,BA,B of Zp\mathbb{Z}_p of size at most αp\alpha p for an appropriate constant α>0\alpha>0, one only needs three elements b1,b2,b3Bb_1,b_2,b_3\in B to guarantee A+{b1,b2,b3}A+B1|A+\{b_1,b_2,b_3\}|\ge |A|+|B|-1. Allowing the use of larger subsets AA', we show that for sets AA of bounded doubling, one only needs a subset AA' with o(A)o(|A|) elements to guarantee that A+A=A+AA+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.

Keywords

Cite

@article{arxiv.2210.07196,
  title  = {Small subsets with large sumset: Beyond the Cauchy--Davenport bound},
  author = {Jacob Fox and Sammy Luo and Huy Tuan Pham and Yunkun Zhou},
  journal= {arXiv preprint arXiv:2210.07196},
  year   = {2022}
}
R2 v1 2026-06-28T03:34:36.620Z