2000 character limit reached
All finite sets are Ramsey in the maximum norm
Published 5 Aug 2020 in math.CO | (2008.02008v3)
Abstract: For two metric spaces $\mathbb X$ and $\mathcal Y$, the chromatic number $\chi(\mathbb X;\mathcal Y)$ of $\mathbb X$ with forbidden $\mathcal Y$ is the smallest $k$ such that there is a coloring of the points of $\mathbb X$ with $k$ colors and no monochromatic copy of $\mathcal Y$. In this paper, we show that for each finite metric space $\mathcal{M}$ that contains at least two points the value $\chi\left(\mathbb Rn_\infty; \mathcal M \right)$ grows exponentially with $n$. We also provide explicit lower and upper bounds for some special $\mathcal M$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.