Papers
Topics
Authors
Recent
Search
2000 character limit reached

On maximal sum-free sets in abelian groups

Published 10 Aug 2021 in math.CO and math.GR | (2108.04615v2)

Abstract: Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of ${1, \dots, n}$, thereby answering a question of Cameron and Erd\H{o}s. In contrast, not as much is know about the analogous problem for finite abelian groups. In this paper we give the first sharp results in this direction, determining asymptotically the number of maximal sum-free sets in both the binary and ternary spaces $\mathbb Zk_2$ and $\mathbb Zk_3$. We also make progress on a conjecture of Balogh, Liu, Sharifzadeh and Treglown concerning a general lower bound on the number of maximal sum-free sets in abelian groups of a fixed order. Indeed, we verify the conjecture for all finite abelian groups with a cyclic component of size at least 3084. Other related results and open problems are also presented.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.