Towards $3n-4$ in groups of prime order
Vsevolod F. Lev, Oriol Serra

TL;DR
This paper proves that small subsets of prime order groups with limited doubling are contained within small arithmetic progressions, advancing understanding of additive structure in such groups.
Contribution
It improves existing results by establishing tighter conditions under which subsets of prime order groups are contained in arithmetic progressions.
Findings
Subsets with small doubling are contained in small arithmetic progressions.
The sumset contains a large arithmetic progression with at least 2|A|-1 terms.
Conditions on subset size and doubling constant are refined.
Abstract
We show that if is a subset of a group of prime order such that and , then is contained in an arithmetic progression with at most terms, and contains an arithmetic progression with the same difference and at least terms. This improves a number of previously known results.
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.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · graph theory and CDMA systems
