Indexed metadata

Lattice coverings by parallelotopes containing cube vertices

Dragomir Grozev, Nikolai Nikolov

Source record

Source: arXiv

Published: Oct 15, 2026

arXiv: 2610.21572

Open original source ↗

Source abstract

We investigate when a parallelotope containing vertices of the unit cube Qn=[0,1]nQ_n=[0,1]^n covers Rn\Bbb R^n by integer translates. We prove the covering property for every parallelepiped containing five vertices of Q3Q_3, and, in any dimension, for every parallelotope containing a facet of QnQ_n and one vertex of the opposite facet. As a consequence, we obtain the sharp bound 1/n1/n for the volume of a pyramid contained in QnQ_n 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.