Document Type

Article

Publication Date

2020

Abstract

In a recent paper, Garber, Gavrilyuk, and Magazinov [Discrete Comput. Geom., 53 (2015), pp. 245--260] proposed a sufficient combinatorial condition for a parallelohedron to be affinely Voronoi. We show that this condition holds for all 5-dimensional Voronoi parallelohedra. Consequently, the Voronoi conjecture in $\mathbb{R}^5$ holds if and only if every 5-dimensional parallelohedron is combinatorially Voronoi. Here, by saying that a parallelohedron $P$ is combinatorially Voronoi, we mean that $P$ is combinatorially equivalent to a Dirichlet--Voronoi polytope for some lattice $\Lambda$, and this combinatorial equivalence is naturally translated into equivalence of the tiling by copies of $P$ with the Voronoi tiling of $\Lambda$. We also propose a new condition which, if satisfied by a parallelohedron $P$, is sufficient to infer that $P$ is affinely Voronoi. The condition is based on the new notion of the Venkov complex associated with a parallelohedron and cohomologies of this complex.

Comments

© 2020, Society for Industrial and Applied Mathematics
Read More: https://epubs.siam.org/doi/abs/10.1137/18M1235004?journalCode=sjdmec

Publication Title

SIAM Journal on Discrete Mathematics

DOI

10.1137/18M1235004

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.