Max-norm Ramsey Theory
Abstract
Given a metric space M that contains at least two points, the chromatic number (Rn∞, M ) is defined as the minimum number of colours needed to colour all points of an n-dimensional space Rn∞ with the max-norm such that no isometric copy of M is monochromatic. The last two authors have recently shown that the value (Rn∞, M ) grows exponentially for all finite M. In the present paper we refine this result by giving the exact value M such that (Rn∞, M ) = (M+o(1))n for all 'one-dimensional' M and for some of their Cartesian products. We also study this question for infinite M. In particular, we construct an infinite M such that the chromatic number (Rn∞, M ) tends to infinity as n → ∞.
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.