Estimate for the chromatic number of Euclidean space with several forbidden distances (Q325532): Difference between revisions

The chromatic number of a metric space \(X\) with \(k\) forbidden distances \(a_1,a_2,\dots,a_k\in\mathbb R^+\) is defined as the minimal number of colors needed to color all vertices of the space \(X\) such that the distance between every two vertices of the same color is not equal to any of the numbers \(a_1,a_2,\dots,a_k\), denoted by \(\chi(X;a_1,a_2, \dots,a_k)\) for short. In 1950, E. Nelson and H. Hadwiger first posed the problem of finding the chromatic number of \(\mathbb R^2\) with a single forbidden distance, it is a pity that the problem still remains unsolved. Recently, many scholars considered chromatic numbers with several forbidden distances to study \[ \bar{\chi}(\mathbb R^n,k)=\max\limits_{a_1,a_2,\dots,a_n\in\mathbb R^+}\chi(\mathbb R^n;a_1,a_2,\dots,a_k). \] \textit{A. M. Raigorodskii} [Russ. Math. Surv. 56, No. 1, 103--139 (2001); translation from Usp. Mat. Nauk 56, No. 1, 107--146 (2001; Zbl 1008.54018)] showed that there are numbers \(B,C>0\) and \(N\) so that, for any \(n\geq N\) and \(k\), \(\bar{\chi}(\mathbb R^n,k)\geq (Bk)^{Cn}\). In this paper, the author obtains following two theorems. Theorem 1. Let positive numbers \(A\), \(C\) and \(K\) be chosen, where \(2\leq A<3\) and \(C<\frac{1}{3}\). Then there is a positive number \(B^\prime\) for which the inequality \(\bar{\chi}(\mathbb R^n,k)\geq(B^\prime k)^{Cn}\) holds for any positive integer \(n\) and \(k\leq Kn^{A}\). Theorem 2. Let a positive number \(C<\frac{1}{3}\) be chosen. Then there is a positive number \(B\) for which the inequality \(\bar{\chi}(\mathbb R^n,k)\geq (Bk)^{Cn}\) holds for any positive integers \(n\) and \(k\). The above refined the result of Raigorodskii [loc. cit.]. All the certification procedures are strict and the ways of proof properly novel.