Английская Википедия:Erdős sumset conjecture

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset <math>A</math> of the natural numbers <math>\mathbb{N} </math> has a positive upper density then there are two infinite subsets <math>B</math> and <math>C</math> of <math>\mathbb{N}</math> such that <math>A</math> contains the sumset <math>B+C</math>.[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

Шаблон:Reflist


Шаблон:Combin-stub