On sets with small sumset and m-sum-free sets in Z/pZ
Pablo Candela, Diego Gonz\'alez-S\'anchez, David J. Grynkiewicz

TL;DR
This paper advances the understanding of small sumset sets in cyclic groups, improves bounds on sum-free set densities, and provides new structural insights and applications in additive combinatorics.
Contribution
It improves bounds related to the $3k-4$ conjecture, enhances the density bounds for $m$-sum-free sets, and offers new structural descriptions of sum-free sets in cyclic groups.
Findings
Improved the bound on $r$ to 0.1368|A| under mild conditions.
Raised the upper bound for the density of $m$-sum-free sets to approximately 1/3.1955.
Provided new structural descriptions for large sum-free sets in $Z/pZ$.
Abstract
The conjecture in groups for prime states that if is a nonempty subset of satisfying and , then is covered by an arithmetic progression of size at most . A theorem of Serra and Z\'emor proves the conjecture provided , without any additional constraint on . Subject to the mild additional constraint (which is optimal in a sense explained in the paper), our first main result improves the bound on , allowing . We also prove a variant which further improves this bound on provided is sufficiently dense. We then give several applications. First we apply the above variant to give a new upper bound for the maximal density of -sum-free sets in , i.e., sets…
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.
