The asymptotic count of maximal sum-free subsets in elementary abelian 5-groups

From papers

Let k\binNk\bin\mathbb N and set n:=5kn:=5^k. Write fmax(G)f_{\max}(G) for the number of maximal sum-free subsets of a finite abelian group GG. The elementary abelian 5-group conjecture.

fmax(Z5k)=3n/10+o(n).f_{\max}(\mathbb Z^k_5)=3^{n/10+o(n)}.

This conjecture concerns the sharp asymptotic number of maximal sum-free subsets in Z5k\mathbb Z^k_5. Structural results on large sum-free subsets are known, but asymptotically exact bounds were not obtained in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Nathanaël Hassler and Andrew Treglown, “Notes on sum-free sets in abelian groups”, arXiv:2506.17401 (2026).

Solutions 0

No solutions have been posted yet.