Lattice coverings by parallelotopes containing cube vertices
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 $1/n$ for the volume of a pyramid contained in with a parallelotope base. We also give an alternative proof of this bound.
Paper Prompts
Sign up for free to create and run prompts on this paper.