Indexed metadata
Lattice coverings by parallelotopes containing cube vertices
Dragomir Grozev, Nikolai Nikolov
Source abstract
We investigate when a parallelotope containing vertices of the unit cube covers by integer translates. We prove the covering property for every parallelepiped containing five vertices of , and, in any dimension, for every parallelotope containing a facet of and one vertex of the opposite facet. As a consequence, we obtain the sharp bound for the volume of a pyramid contained in with a parallelotope base. We also give an alternative proof of this bound.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.