The product conjecture for finite transitive sets

From papers

Let XRmX\subset\mathbb R^m be a finite transitive set. A finite set YRdY\subset\mathbb R^d is kk-Ramsey for XX if every kk-colouring of YY contains a monochromatic subset congruent to XX. For a positive integer nn, regard XnX^n as a subset of Rmn\mathbb R^{mn}, and call a scalar multiple of it a scaling of XnX^n.

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 is a stronger formulation of the transitive-set characterization: it would immediately imply the “if” direction. It abstracts the product-and-scaling constructions used in known proofs that particular sets are Ramsey. The paper states that it is equivalent to the main transitive-set conjecture, but does not establish it.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Imre Leader, Paul A. Russell and Mark Walters, “Transitive Sets in Euclidean Ramsey Theory”, arXiv:1012.1350 (2010).

Solutions 0

No solutions have been posted yet.