A four-point Hamming barrier in Euclidean Ramsey theory
Statement
Euclidean Ramsey sets
Ron Graham
Let be a finite set in (-dimensional Euclidean space). We say that is Ramsey if for all positive integers there exists such that if one colors the points of with colors, then there exists a monochromatic set congruent to .
For example, if consist of two points, then is Ramsey. (Consider an -coloring of the vertices of a unit simplex simplex in ).
A set is spherical if it lies on some sphere.
Theorem. (Erd\H{o}s--Graham--Montgomery--Rothschild--Spencer--Straus). Every Ramsey set is spherical.
Conjecture. ($1000) Every finite spherical set is Ramsey.
A ``warm up'':
Record
- Source
- Added
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.