Erdős sumset conjecture

From testwiki
Revision as of 23:23, 5 March 2024 by imported>Fixmaster
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset A of the natural numbers has a positive upper density then there are two infinite subsets B and C of such that A contains the sumset B+C.[1][2] It was posed by Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.[3]

See also

Notes

Template:Reflist


Template:Combin-stub