ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.