An improved bound for sumsets of thick compact sets via the Shapley--Folkman theorem
Scott Duke Kominers

TL;DR
This paper improves bounds on the number of summands needed for sumsets of thick compact sets in Euclidean space to have non-empty interior, using a convexification approach based on the Shapley--Folkman theorem.
Contribution
It introduces a new bound that reduces the exponent in the thickness parameter from 3 to 2, with an explicit dependence on the dimension.
Findings
The new bound is n > 6√d c^{-2} for sumsets to have non-empty interior.
The proof replaces a stepwise enlargement with a simultaneous convexification.
The bound explicitly depends on the dimension d and the thickness c.
Abstract
Let be compact sets of positive diameter with Feng--Wu thickness at least . Feng and Wu proved that has non-empty interior when . We show that \[n>\frac{\sqrt d}{(\sqrt{1+c}-1)^2}=\frac{\sqrt d\,(\sqrt{1+c}+1)^2}{c^2}\] already suffices. In particular, since , the bound is enough. For fixed dimension , this improves the exponent in from to , while introducing only an explicit factor of . The proof replaces the one-summand-at-a-time enlargement of Feng--Wu by a simultaneous convexification step based on a radius form of the Shapley--Folkman theorem.
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.
