Erdős sumset conjecture

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by John B123 (talk | contribs) at 17:59, 18 June 2020 (Added tags to the page using Page Curation (unreferenced)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a set has a positive upper density then contains the sumset , where and are infinite subsets of . It was posed by Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.

See also

List of conjectures by Paul Erdős

References