Keywords

#erdős_sumset_conjecture

Erdős sumset conjecture

Conjecture in additive combinations about subsets of natural numbers

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

Tue 5th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Erdős sumset conjecture List of conjectures by Paul Erdős List of things named after Paul Erdős List of unsolved problems in mathematics Restricted sumset Erdős–Szemerédi theorem List of number theory topics Arithmetic combinatorics Schnirelmann density Additive combinatorics
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.