A proof of a sumset conjecture of Erdos

Joel Pedro Moreira, Florian K. Richter, Donald Robertson

Research output: Contribution to journalArticlepeer-review


In this paper we show that every set AN 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.

MSC Codes 05D10, 11P70, 37A99, 46C99

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Mar 1 2018

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'A proof of a sumset conjecture of Erdos'. Together they form a unique fingerprint.

Cite this