A proof of a sumset conjecture of Erdos
Abstract
In this paper we show that every set A ⊂ N with positive density contains B+C for some pair B,C of infinite subsets of N, settling a conjecture of Erdos. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.