Notes on sum-free sets in abelian groups
Nathana\"el Hassler, Andrew Treglown

TL;DR
This paper discusses open problems and asymptotically determines the number of maximal sum-free subsets in most even order abelian groups using the container method.
Contribution
It introduces new asymptotic results on the count of maximal sum-free sets in abelian groups and highlights open problems in the area.
Findings
Asymptotic enumeration of maximal sum-free sets in most even order abelian groups
Identification of open problems related to sum-free sets in abelian groups
Application of the container method to this combinatorial problem
Abstract
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups we asymptotically determine the number of maximal distinct sum-free subsets in . Our proof makes use of the container method.
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.
