A proof of a sumset conjecture of Erd\H{o}s
Combinatorics
2019-06-14 v6 Dynamical Systems
Abstract
In this paper we show that every set with positive density contains for some pair of infinite subsets of , settling a conjecture of Erd\H{o}s. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups.
Keywords
Cite
@article{arxiv.1803.00498,
title = {A proof of a sumset conjecture of Erd\H{o}s},
author = {Joel Moreira and Florian Karl Richter and Donald Robertson},
journal= {arXiv preprint arXiv:1803.00498},
year = {2019}
}
Comments
54 pages. Corrected proof of Theorem 3.22 and added Example 3.27 Keywords: sum sets, almost periodic functions, ultrafilters