ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X⊂RmX\subset\mathbb{R}^m be a finite transitive set. A set Y⊂RdY\subset\mathbb{R}^d is kk-Ramsey for XX if every kk-colouring of YY contains a subset congruent to XX. For a positive integer nn, regard XnX^n as a subset of Rmn\mathbb{R}^{mn}, and call λXn={λx:x∈Xn}\lambda X^n=\{\lambda x:x\in X^n\} a scaling of XnX^n.

The product conjecture. For every positive integer kk, there exists a positive integer nn such that some scaling of XnX^n is kk-Ramsey for XX.

This strengthens the usual approach to proving that sets are Ramsey, in which a finite transitive set is embedded and then a large product is coloured. The conjecture is presented as the geometric statement later reformulated in purely combinatorial terms; its resolution is not specified in the supplied text.

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.