March 2019 A proof of a sumset conjecture of Erdős
Joel Moreira, Florian Richter, Donald Robertson
Author Affiliations +
Ann. of Math. (2) 189(2): 605-652 (March 2019). DOI: 10.4007/annals.2019.189.2.4

Abstract

In this paper we show that every set $A\subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, 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.

Citation

Download Citation

Joel Moreira. Florian Richter. Donald Robertson. "A proof of a sumset conjecture of Erdős." Ann. of Math. (2) 189 (2) 605 - 652, March 2019. https://doi.org/10.4007/annals.2019.189.2.4

Information

Published: March 2019
First available in Project Euclid: 21 December 2021

Digital Object Identifier: 10.4007/annals.2019.189.2.4

Subjects:
Primary: 05D10 , 11P70 , 37A99 , 46C99

Keywords: almost periodic functions , sum sets , ultrafilters

Rights: Copyright © 2019 Department of Mathematics, Princeton University

JOURNAL ARTICLE
48 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.189 • No. 2 • March 2019
Back to Top