Abstract
In this paper, we give new upper bounds for the chromatic numbers for integer lattices and some rational spaces and other lattices. In particular, we have proved that for any concrete integer number d, the chromatic number of ℤn with critical distance \( \sqrt{2d} \) has a polynomial growth in n with exponent less than or equal to d (sometimes this estimate is sharp). The same statement is true not only in the Euclidean norm, but also in any l p norm. Moreover, we have given concrete estimates for some small dimensions as well as upper bounds for the chromatic number of ℚ n p , where by ℚ p we mean the ring of all rational numbers having denominators not divisible by some prime numbers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Benda and M. Perles, “Introduction to colorings of metric spaces,” Geombinatorics, 9, 111–126 (2000).
P. Brass, L. Moser, and J. Pach, Research Problems in Discrete Geometry, Springer, N.Y. (2005).
J. Cibulka, “On the chromatic numbers of real and rational spaces,” Geombinatorics, 18, 53–65 (2008).
N.G. de Bruijn and P. Erd˝os, “A colour problem for infinite graphs and a problem in the theory of relations,” Nederl. Akad. Wetensch. Proc. Ser. A, 54, 371—373 (1951).
P. Frankl and R.M.Wilson, “Intersection theorems with geometric consequences,” Combinatorica, 1, 357–368 (1981).
Z. Füredi and J.-H. Kang, “Distance graphs on ℤn with l 1-norm,” Theor. Comput. Sci., 319, 357–366 (2004).
A.B. Kupavskii, “On the colouring of spheres embedded in ℝn ,” Sb. Math., 202, No. 6, 859–886 (2011).
D. G. Larman and C.A. Rogers, “The Realization of Distances within Sets in Euclidean Space,” Mathematika, 19, 1–24 (1972).
L. Moser and W. Moser, “Solution to Problem 10,” Can. Math. Bull, 4, 187–189 (1961).
K. O’Bryant, “A Complete annotated bibliography of work related to Sidon sequences,” arXiv: math.NT/0407.117 (2011)
A. M. Raigorodskii, “Borsuk’s problem and the chromatic numbers of some metric spaces,” Russ. Math. Surv., 56, No. 1, 103–139 (2001).
A. M. Raigorodskii, “On the chromatic number of a space with the metric l q ,” Russ. Math. Surv., 59, No. 5, 973–975 (2004).
A. M. Raigorodskii, Linear-algebraic Method in Combinatorics [in Russian], MTsNMO, Moscow (2007).
D. E. Raiskii, “Realization of all distances in a decomposition of ℝn into n + 1 parts,” Math. Notes, 7, 194–196 (1970).
I. Ruzsa, “Solving a linear equation in a set of integers. I,” Acta Arith., 65, No. 3, 259–282 (1993).
I. Ruzsa, “Solving a linear equation in a set of integers. II,” Acta Arith., 72, No. 4, 385–397 (1995).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sovremennaya Matematika. Fundamental’nye Napravleniya (Contemporary Mathematics. Fundamental Directions), Vol. 51, Topology, 2013.
Rights and permissions
About this article
Cite this article
Manturov, V.O. On the Chromatic Numbers of Integer and Rational Lattices. J Math Sci 214, 687–698 (2016). https://doi.org/10.1007/s10958-016-2806-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-016-2806-1