The Erdos-Moser sum-free set problem
arXiv:1804.03356 · doi:10.4153/S0008414X1900049X
Abstract
We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.
arXiv comment47 pages. Corrections and clarifications
References in corpus (7)
- A Szemeredi-type regularity lemma in abelian groups, with applications
- Progression-free sets in Z_4^n are exponentially small
- A quantitative improvement for Roth's theorem on arithmetic progressions
- A quantitative version of the idempotent theorem in harmonic analysis
- An inverse theorem for the Gowers U^3 norm
- On one problem of Gowers
- On sets of large exponential sums