Small subsets with large sumset: Beyond the Cauchy--Davenport bound
Abstract
For a subset of an abelian group , given its size , its doubling , and a parameter which is small compared to , we study the size of the largest sumset that can be guaranteed for a subset of of size at most . We show that a subset of size at most can be found so that . 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 of of size at most for an appropriate constant , one only needs three elements to guarantee . Allowing the use of larger subsets , we show that for sets of bounded doubling, one only needs a subset with elements to guarantee that . 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.
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}
}