Papers
Topics
Authors
Recent
Search
2000 character limit reached

Max-norm Ramsey Theory

Published 17 Nov 2021 in math.CO | (2111.08949v3)

Abstract: Given a metric space $\mathcal{M}$ that contains at least two points, the chromatic number $\chi\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 $\chi\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 $\chi_{\mathcal{M}}$ such that $\chi\left(\mathbb{R}n_{\infty}, \mathcal{M} \right) = (\chi_{\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 $\chi\left(\mathbb{R}n_{\infty}, \mathcal{M} \right)$ tends to infinity as $n \rightarrow \infty$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.