A proof of a sumset conjecture of Erdős

Donald Robertson, Joel Moreira, Florian Richter

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdő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.
Original languageEnglish
Pages (from-to)605-652
JournalAnnals of Mathematics
Volume189
Issue number2
DOIs
Publication statusPublished - 1 Mar 2019

Fingerprint

Dive into the research topics of 'A proof of a sumset conjecture of Erdős'. Together they form a unique fingerprint.

Cite this