The minimal red progression length in Euclidean Ramsey theory
Statement
For integers , let denote -dimensional Euclidean space, and let denote a set of equally spaced collinear points. Write if every red-blue coloring of contains either a red copy of or a blue copy of . The minimal-length conjecture. There is an integer such that for every integer ,
This conjecture asks whether three is the smallest first progression length for which some fixed blue progression length avoids the corresponding Euclidean Ramsey property in every dimension. The preceding results establish related positive and negative statements for other progression lengths, but the conjectured case remains open.
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.