The product conjecture for finite transitive sets in Euclidean Ramsey theory
Statement
Let be a finite transitive set. A set is -Ramsey for if every -colouring of contains a subset congruent to . For a positive integer , regard as a subset of , and call a scaling of .
The product conjecture. For every positive integer , there exists a positive integer such that some scaling of is -Ramsey for .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.