Sum-Free Set
A sum-free set
is a set for which the intersection of
and the sumset
is empty.
For example, the sum-free sets of are
,
,
,
,
, and
. The numbers of sum-free subsets of
for
, 1, ... are 1, 2, 3, 6, 9, 16, 24, 42, 61, ... (OEIS A007865).
The numbers of sum-free sets can be computed in the Wolfram Language using the following code (P. Abbott, pers. comm., Nov. 24, 2005):
NumbersOfSumFreeSets[nmax_] := Module[{n = 0},
Last[Reap[Nest[(++n; Sow[Length[#]];
Union[#, Union[#, {n}]& /@
Select[#, Intersection[#, n - #] == {}&]])&,
{{}}, nmax + 1]
]
]
]
See also
A-Sequence, Cameron's Sum-Free Set Constant, Double-Free Set, Hofstadter Sequences, Prime Number of Measurement, s-Additive Sequence, Schur Number, Schur's Problem, Stöhr Sequence, Triple-Free SetExplore with Wolfram|Alpha
References
Abbott, H. L. and Moser, L. "Sum-Free Sets of Integers." Acta Arith. 11, 392-396, 1966.Cameron, P. J. and Erdős, P. "On the Number of Sets of Integers with Various Properties." Number Theory. Proceedings of the First Conference of the Canadian Number Theory Association held in Banff, Alberta, April 17-27, 1988 (Ed. R. A. Mollin). Berlin: de Gruyter, pp. 61-79, 1990.Cameron, P. J. and Erdős, P. "Notes on Sum-Free and Related Sets." Combin. Probab. Comput. 8, 95-107, 1999.Exoo, G. "A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers ofReferenced on Wolfram|Alpha
Sum-Free SetCite this as:
Weisstein, Eric W. "Sum-Free Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Sum-FreeSet.html