Math 2.0

Proposition

Erdős sumset conjecture

Statement

In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset AA of the natural numbers ℕ\mathbb{N} has a positive upper density then there are two infinite subsets BB and CC of ℕ\mathbb{N} such that AA contains the sumset B+CB+C. It was posed by Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.

Further reading

  1. Wikipedia, page 64308146, revision 1212046137, Erdős sumset conjecture. adopted
About this page
TagD5WSHR29WE
URIm2://D5WSHR29WE
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status D5WSHR29WE.
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.