ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A sequence AA is Ramsey 2-complete if every two-colouring of AA makes every sufficiently large positive integer a sum of distinct terms of one colour. Improve the known lower and upper growth restrictions, represented in the source by the exponents 1/21/2 and 1/31/3 in the bounds for its enumerating function.

Record

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.