Lower Bound on Translative Covering Density of Octahedron

arXiv2304.07833MaRDI QIDQ6433264FDOQ6433264

Authors: Yiming Li, Yanlu Lian, Miao Fu, Yuqin Zhang 

Publication date: 16 April 2023

Abstract: In this paper, we present the first nontrivial lower bound on the translative covering density of octahedron. To this end, we show the lower bound, in any translative covering of octahedron, on the density relative to a given parallelehedron. The resulting lower bound on the translative covering density of octahedron is $1+6.6imes10^{-8}$.

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Distance in graphs (05C12) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

This page was built for publication: Lower Bound on Translative Covering Density of Octahedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433264)