arXiv Analytics

Sign in

arXiv:1804.03356 [math.CA]AbstractReferencesReviewsResources

The Erdos-Moser sum-free set problem

Tom Sanders

Published 2018-04-10, updated 2018-05-20Version 2

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.

Comments: 43 pages. Expanded discussion in section 2. Fixed some typos
Categories: math.CA, math.CO
Related articles: Most relevant | Search more
arXiv:math/0101125 [math.CA] (Published 2001-01-15, updated 2001-01-16)
Duality of orthogonal polynomials on a finite set
arXiv:1309.1175 [math.CA] (Published 2013-09-04, updated 2014-09-16)
Exceptional Charlier and Hermite orthogonal polynomials
arXiv:2211.13646 [math.CA] (Published 2022-11-24)
Singular integrals along variable codimension one subspaces

Links

Toolbox