On the Voronoi Conjecture for combinatorially Voronoi parallelohedra in dimension five
Abstract
In a recent paper Garber, Gavrilyuk and Magazinov proposed a sufficient combinatorial condition for a parallelohedron to be affinely Voronoi. We show that this condition holds for all five-dimensional Voronoi parallelohedra. Consequently, the Voronoi conjecture in R5 holds if and only if every five-dimensional parallelohedron is combinatorially Voronoi. Here, by saying that a parallelohedron P is combinatorially Voronoi, we mean that the tiling T(P) by translates of P is combinatorially isomorphic to some tiling T(P'), where P' is a Voronoi parallelohedron, and that the isomorphism naturally induces a linear isomorphism of lattices (P) and (P'). We also propose a new sufficient condition implying that a parallelohedron is affinely Voronoi. The condition is based on the new notion of the Venkov complex associated with a parallelohedron.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.