2024/07/03 by Frank Vallentin, Vallentin, Frank, Stephen Weißbach +3 · 1 citation
Business, Management and Accounting · Computer Science · Engineering · #Advanced Algebra and Logic #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Optics and Image Analysis #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2407.03513
openalex publication_date 2024/07/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The chromatic number of a lattice in n-dimensional Euclidean space is defined as the chromatic number of its Voronoi graph. The Voronoi graph is the Cayley graph on the lattice having the strict Voronoi vectors as generators. In this paper we determine the chromatic number of all 4-dimensional lattices. To achieve this we use the known classification of 52 parallelohedra in dimension 4. These 52 geometric types yield 16 combinatorial types of relevant Voronoi graphs. We discuss a systematic approach to checking for isomorphism of Cayley graphs of lattices. Lower bounds for the chromatic number are obtained from choosing appropriate small finite induced subgraphs of the Voronoi graphs. Matching upper bounds are derived from periodic colorings. To determine the chromatic numbers of these finite graphs, we employ a SAT solver.