The Cameron-Erdos Conjecture
数论
2007-05-23 v1 组合数学
摘要
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
引用
@article{arxiv.math/0304058,
title = {The Cameron-Erdos Conjecture},
author = {Ben Green},
journal= {arXiv preprint arXiv:math/0304058},
year = {2007}
}
备注
11 pages, to appear in Bull. London Math. Soc