Lower Bound on Translative Covering Density of Tetrahedra

DOI10.1007/S00454-023-00602-0MaRDI QIDQ6403245zbMATH OpenOpenAlexFDO

Authors Yiming Li, Miao Fu, Yuqin Zhang

Publication date 27 June 2022

Full work available at URL https://doi.org/10.1007/s00454-023-00602-0

Mathematics Subject Classification ID

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

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

Recommendations

• Lower bound on the translative covering density of octahedra
• Lower Bounds on Lattice Covering Densities of Simplices
• On the translative packing densities of tetrahedra and cuboctahedra
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Covering the plane with translates of a triangle

Cited in

(2)

• Lower Bounds on Lattice Covering Densities of Simplices
• Lower bound on the translative covering density of octahedra

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

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