Sumfree sets in groups: a survey
Terence Tao, Van Vu

TL;DR
This survey explores sum-free sets in groups, providing characterizations for large sets, counterexamples for certain conjectures, and conditions under which positive results hold, advancing understanding of additive combinatorics in group structures.
Contribution
The paper offers a new characterization of large sum-free sets in abelian groups, disproves a conjecture for all k ≥ 4, and establishes conditions for positive results based on group order.
Findings
Counterexamples for all k ≥ 4 to Erdős's conjecture
Characterization of large sum-free sets in abelian groups
Positive results when group order is not divisible by small primes
Abstract
We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a characterization for large sets in an abelian group which do not contain a subset of fixed size such that the sum of any two different elements of do not belong to (in other words, is sum-free with respect to ). Erd\H{o}s, in the above mentioned survey, conjectured that if is sufficiently large compared to , then contains two elements that add up to zero. This is known to be true for . We give counterexamples for all . On the other hand, using the new characterization result, we are able to prove a positive result in the case when is not divisible by small primes.
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems
