Nowhere dense Ramsey sets
Abstract
A set of points S in Euclidean space Rd is called Ramsey if any finite partition of R∞ yields a monochromatic copy of S. While characterization of Ramsey set remains a major open problem in the area, a stronger ``density'' concept was considered in [J. Amer. Math. Soc. 3, 1--7, 1990]: If S is a d-dimensional simplex, then for any μ>0 there is an integer d:=d(S,μ) and finite configuration X⊂eq Rd such that any subconfiguration Y⊂eq X with |Y|≥ μ |X| contains a copy of S. Complementing this, here we show the existence of μ:=μ(S) and of an infinite configuration X⊂eq R∞ with the property that any finite coloring of X yields a monochromatic copy of S, yet for any finite set of points Y⊂eq X contains a subset Z⊂eq Y of size |Z|≥ μ |Y| without a copy of S.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.