On the chromatic numbers of integer and rational lattices

From MaRDI portal
Publication:289743

DOI10.1007/S10958-016-2806-1zbMATH Open1343.05065arXiv1206.1934OpenAlexW1563336873MaRDI QIDQ289743FDOQ289743


Authors: V. O. Manturov Edit this on Wikidata


Publication date: 31 May 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Abstract: In the present paper, we have found new upper bounds for chromatic numbers for integer lattices and some rational spaces and other lattices. In particular, we have proved that for any concrete critical distance d the chromatic number of with critical distance sqrt2d 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 lp norm. Besides, we have given concrete estimates for some small dimensions as well as upper bounds for the chromatic number of Qpn, where by Qp we mean the ring of all rational numbers having denominators not divisible by some prime numbers.


Full work available at URL: https://arxiv.org/abs/1206.1934




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On the chromatic numbers of integer and rational lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289743)