Skip to main content
Log in

On the measurable chromatic number of a space of dimension n ≤ 24

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

This paper is devoted to the classical problem of finding the measurable chromatic number of n-dimensional Euclidean space, i.e., the value χ m (ℝn) equal to the least possible number of Lebesgue measurable sets that do not contain pairs of points at a distance of 1 and cover the whole space. Assuming that a certain hypothesis is true, we significantly improve the lower bounds for χ m (ℝn).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. M. Raigorodskii, Russ. Math. Surv. 56 (1), 103–139 (2001).

    Article  MATH  MathSciNet  Google Scholar 

  2. A. M. Raigorodskii, “Coloring distance graphs and graphs of diameters,” in Thirty Essays on Geometric Graph Theory (Springer, Berlin, 2013), pp. 429–460.

    Book  Google Scholar 

  3. A. Soifer, The Mathematical Coloring Book (Springer, Berlin, 2009).

    MATH  Google Scholar 

  4. K. J. Falconer, J. Combin. Theory Ser. A 31 (2), 184–189 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  5. F. M. de Oliveira Filho and F. Vallentin, J. Eur. Math. Soc. 12, 1417–1428 (2010).

    Article  MATH  Google Scholar 

  6. Ch. Bachoc, A. Passuello, and A. Thiery, “The density of sets avoiding distance in Euclidean space,” arXiv:1401.6140.

  7. H. T. Croft, Eureka (Cambridge) 30, 22–26 (1967).

    Google Scholar 

  8. A. B. Kupavskii, A. M. Raigorodskii, and M. V. Titova, Tr. Mosk. Fiz. Tekh. Inst. 4 (1), 111–121 (2012).

    Google Scholar 

  9. A. M. Raigorodskii, Russ. Math. Surv. 55 (2), 351–352 (2000).

    Article  MathSciNet  Google Scholar 

  10. A. M. Raigorodskii, Russ. Math. Surv. 54 (2), 453–454 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  11. V. K. Lyubimov and A. M. Raigorodskii, Dokl. Math. 80 (1), 547–549 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  12. A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, and A. S. Usachev, Math. Notes 86 (5), 744–746 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  13. A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, and A. S. Usachev, J. Math. Sci. 165 (6), 689–709 (2009).

    Article  MathSciNet  Google Scholar 

  14. V. F. Moskva and A. M. Raigorodskii, Math. Notes 89 (2), 307–308 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  15. M. S. Andersen, J. Dahl, and L. Vandenberghe, CVXOPT: A Python Package for Convex Optimization, Version 1.1.6, available at cvxopt.org.2013.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to L. I. Bogolubsky.

Additional information

Original Russian Text © L.I. Bogolubsky, A.M. Raigorodskii, 2015, published in Doklady Akademii Nauk, 2015, Vol. 465, No. 6, pp. 647–650.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bogolubsky, L.I., Raigorodskii, A.M. On the measurable chromatic number of a space of dimension n ≤ 24. Dokl. Math. 92, 761–763 (2015). https://doi.org/10.1134/S1064562415060344

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562415060344

Keywords

Navigation