Erdős sumset conjecture
id:
erd-s-sumset-conjecture-251-11147343
title:
Erdős sumset conjecture
text:
In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset A of the natural numbers N has a positive upper density then there are two infinite subsets B and C of N such that A contains the sumset B + C . It was posed by Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.
brand slug:
wiki
category slug:
encyclopedia
description:
Conjecture in additive combinations about subsets of natural numbers
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s_sumset_conjecture
date created:
date modified:
2024-03-05T22:23:05Z
main entity:
{"identifier":"Q104844985","url":"https://www.wikidata.org/entity/Q104844985"}
image:
fields total:
13
integrity:
14