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
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 the chromatic number of with critical distance has a polynomial growth in with exponent less than or equal to (sometimes this estimate is sharp). The same statement is true not only in the Euclidean norm, but also in any norm. Besides, we have given concrete estimates for some small dimensions as well as upper bounds for the chromatic number of , where by 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
- Research Problems in Discrete Geometry
- Intersection theorems with geometric consequences
- Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
- Borsuk's problem and the chromatic numbers of some metric spaces
- The realization of distances within sets in Euclidean space
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the colouring of spheres embedded in \(\mathbb R^n\)
- On the chromatic number of real and rational spaces
- Title not available (Why is that?)
- Solving a linear equation in a set of integers I
- The chromatic number of a space with the metric $ l_q$
- Solving a linear equation in a set of integers II
- Title not available (Why is that?)
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
Cited In (7)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
- On the chromatic numbers of rational spaces
- A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt!
- On the packing chromatic number of some lattices
- Borsuk's partition problem and finite point sets
- Coloring the Voronoi tessellation of lattices
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)