Table of Contents
Fetching ...

Max-norm Ramsey Theory

Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev

Abstract

Given a metric space $\mathcal{M}$ that contains at least two points, the chromatic number $χ\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right)$ is defined as the minimum number of colours needed to colour all points of an $n$-dimensional space $\mathbb{R}^n_{\infty}$ with the max-norm such that no isometric copy of $\mathcal{M}$ is monochromatic. The last two authors have recently shown that the value $χ\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right)$ grows exponentially for all finite $\mathcal{M}$. In the present paper we refine this result by giving the exact value $χ_{\mathcal{M}}$ such that $χ\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right) = (χ_{\mathcal{M}}+o(1))^n$ for all 'one-dimensional' $\mathcal{M}$ and for some of their Cartesian products. We also study this question for infinite $\mathcal{M}$. In particular, we construct an infinite $\mathcal{M}$ such that the chromatic number $χ\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right)$ tends to infinity as $n \rightarrow \infty$.

Max-norm Ramsey Theory

Abstract

Given a metric space that contains at least two points, the chromatic number is defined as the minimum number of colours needed to colour all points of an -dimensional space with the max-norm such that no isometric copy of is monochromatic. The last two authors have recently shown that the value grows exponentially for all finite . In the present paper we refine this result by giving the exact value such that for all 'one-dimensional' and for some of their Cartesian products. We also study this question for infinite . In particular, we construct an infinite such that the chromatic number tends to infinity as .
Paper Structure (23 sections, 38 theorems, 100 equations)

This paper contains 23 sections, 38 theorems, 100 equations.

Key Result

Theorem 1

For any finite metric space ${\mathcal{M}}$ that contains at least two points, there exists a constant $c=c({\mathcal{M}})>1$ such that for all $n \in {\mathbb N}$ we have

Theorems & Definitions (61)

  • Theorem 1: Kupavskii--Sagdeev KupSag
  • Theorem 2
  • Theorem 3
  • Theorem 4
  • Theorem 5
  • Corollary 6
  • Proposition 7
  • Theorem 8
  • Theorem 9
  • Proposition 10
  • ...and 51 more