A structure theorem for sets of small popular doubling
Przemys{\l}aw Mazur

TL;DR
This paper establishes a structure theorem for sets with small popular doubling, showing they are close to arithmetic progressions, and applies this to improve probability estimates for large gaps in sumsets.
Contribution
It proves a new structure theorem for sets with small popular doubling and refines probability bounds for large gaps in sumsets.
Findings
Sets with small popular doubling are close to arithmetic progressions.
Improved estimate: probability that a random subset has a large gap in its sumset is Θ(2^{-k/2}).
Enhanced understanding of sumset structure and probabilistic behavior.
Abstract
In this paper we prove that every set satisfying the inequality for and in suitable ranges, then must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset satisfies ; specifically we show that .
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.
