The number of sum-free sets in abelian groups (Q1425493)

A subset \(A\) of an abelian group is called sum-free if the equation \(x+y=z\) has no solutions in the elements of \(A\). It was shown in [\textit{V. F. Lev}, \textit{T. Łuczak} and \textit{T. Schoen}, Isr. J. Math. 125, 347--367 (2001; Zbl 1055.20043)] that the number \(s(G)\) of sum-free subsets of a finite abelian group \(G\) with \(n:= |G|\) elements is \(s(G)=t\cdot 2^{n/2}+O(2^{(1/2-c)n})\), where \(t=t(G)\) is the number of index-two subgroups of \(G\) and \(c>0\) is an absolute constant. Using graph-theoretic tools, the main result of this paper is as follows: For sufficiently large even \(n\) for any abelian group \(G\) of order of \(n\) with number of subgroups of index 2 equal to \(t\) the inequalities \[ t\cdot 2^{n/2} - 2^{(n/4)(1+o(1))} \leq s(G)\leq t\cdot 2^{n/2} + 2^{n(1/2-c)} \] are valid, where \(c=0,017\). A generalization of the result in question was obtained by \textit{B. Green} and \textit{I. Z. Ruzsa} [Isr. J. Math. 147, 157--188 (2005; Zbl 1158.11311)].