English

Max-norm Ramsey Theory

Combinatorics 2024-02-15 v3

Abstract

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

Keywords

Cite

@article{arxiv.2111.08949,
  title  = {Max-norm Ramsey Theory},
  author = {Nóra Frankl and Andrey Kupavskii and Arsenii Sagdeev},
  journal= {arXiv preprint arXiv:2111.08949},
  year   = {2024}
}

Comments

32 pages. v3: a few modifications based on the reviews

R2 v1 2026-06-24T07:41:46.544Z