Counting sumsets and sum-free sets modulo a prime
暂无分享,去创建一个
Let p be a prime. A set A of residues modulo p is said to be sum-free if there are no solutions to a = a′ + a″ with a, a′, a″ ∈ A. We show that there are 2p/3+o(p) such sets. We also count the number of distinct sets of the form B + B, where B is a set of residues modulo p. Once again, there are 2p/3+o(p) such sets.
[1] Neil J. Calkin. On the Number of Sum-Free Sets , 1990 .
[2] J. Pollard. A Generalisation of the Theorem of Cauchy and Davenport , 1974 .
[3] Cameron-Erdős Modulo a Prime , 2002 .
[4] Vsevolod F. Lev,et al. Sum-free sets in abelian groups , 2001 .