|
This article is cited in 6 scientific papers (total in 6 papers)
Free and Nonfree Voronoi Polyhedra
V. P. Grishukhin Central Economics and Mathematics Institute, RAS
Abstract:
The Voronoi polyhedron of some point $v$ of a translation lattice is the closure of the set of points in space that are closer to $v$ than to any other lattice points. Voronoi polyhedra are a special case of parallelohedra, i.e., polyhedra whose parallel translates can fill the entire space without gaps and common interior points. The Minkowski sum of a parallelohedron with a segment is not always a parallelohedron. A parallelohedron $P$ is said to be free along a vector $e$ if the sum of $P$ with a segment of the line spanned by $e$ is a parallelohedron. We prove a theorem stating that if the Voronoi polyhedron $P_V(f)$ of a quadratic form $f$ is free along some vector, then the Voronoi polyhedron $P_V(g)$ of each form $g$ lying in the closure of the L-domain of $f$ is also free along some vector. For the dual root lattice $E_6^*$ and the infinite series of lattices $D_{2m}^+$, $m\geqslant 4$, we prove that their Voronoi polyhedra are nonfree in all directions.
Keywords:
parallelohedron, Voronoi polyhedron, Delaunay polyhedron, Minkowski sum, quadratic form, L-domain, Gram matrix.
Received: 11.10.2005 Revised: 10.01.2006
Citation:
V. P. Grishukhin, “Free and Nonfree Voronoi Polyhedra”, Mat. Zametki, 80:3 (2006), 367–378; Math. Notes, 80:3 (2006), 355–365
Linking options:
https://www.mathnet.ru/eng/mzm2822https://doi.org/10.4213/mzm2822 https://www.mathnet.ru/eng/mzm/v80/i3/p367
|
|