On the chromatic numbers of integer and rational lattices

DOI10.1007/S10958-016-2806-1MaRDI QIDQ289743zbMATH OpenOpenAlexFDO

Authors V. O. Manturov

Publication date 31 May 2016

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

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

zbMATH Keywords

chromatic number for integer lattices

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

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 $l_p$ norm. Besides, we have given concrete estimates for some small dimensions as well as upper bounds for the chromatic number of $Q_p^n$, where by $Q_p$ we mean the ring of all rational numbers having denominators not divisible by some prime numbers.

Recommendations

• scientific article; zbMATH DE number 68356
• A new lower bound for the chromatic number of the rational space
• scientific article; zbMATH DE number 2058509
• On the chromatic number of real and rational spaces
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm

Cites work

• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• scientific article; zbMATH DE number 3179708 (Why is no real title available?)
• scientific article; zbMATH DE number 1406330 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Intersection theorems with geometric consequences
• On the chromatic number of real and rational spaces
• On the colouring of spheres embedded in \(\mathbb R^n\)
• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Research Problems in Discrete Geometry
• Solving a linear equation in a set of integers I
• Solving a linear equation in a set of integers II
• The chromatic number of a space with the metric $ l_q$
• The realization of distances within sets in Euclidean space

Cited in

(7)

• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt!
• Chromatic zeros on hierarchical lattices and equidistribution on parameter space
• On the packing chromatic number of some lattices
• On the chromatic numbers of rational spaces
• 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)