2000 character limit reached
Notes on sum-free sets in abelian groups
Published 20 Jun 2025 in math.CO, math.GR, and math.NT | (2506.17401v1)
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 $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our proof makes use of the container method.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.