Small doubling in prime-order groups: from $2.4$ to $2.6$
Vsevolod F. Lev, Ilya D. Shkredov

TL;DR
This paper improves bounds on the structure of small doubling sets in prime-order groups, showing they are contained in arithmetic progressions under new, tighter conditions by leveraging higher energy properties.
Contribution
It provides sharper bounds for small doubling sets in prime groups, extending previous results with novel use of higher energy techniques.
Findings
Sets with small sumsets are contained in arithmetic progressions.
Improved bounds from 2.4 to 2.6 in doubling constants.
Results apply to subsets of finite prime fields with size constraints.
Abstract
Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset with prime and , (i) if and , then is contained in an arithmetic progression of size , and (ii) if , then is contained in an arithmetic progression of size . The improvement comes from using the properties of higher energies.
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.
