Lower Bounds on Lattice Covering Densities of Simplices

DOI10.1137/22M1514155MaRDI QIDQ6046813zbMATH OpenOpenAlexFDO

Authors Miao Fu, Fei Xue, Chuan Ming Zong

Publication date 6 September 2023

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.06025

zbMATH Keywords

simplexdegree-diameter problemlattice covering

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)

Abstract: This paper presents new lower bounds for the lattice covering densities of simplices by studying the Degree-Diameter Problem for abelian Cayley digraphs. In particular, it proves that the density of any lattice covering of a tetrahedron is at least $25/18$ and the density of any lattice covering of a four-dimensional simplex is at least $343/264$.

Recommendations

• Lower Bound on Translative Covering Density of Tetrahedra
• New bounds on the density of lattice coverings
• Diameter series of lattice covering simplices
• Lattice-Simplex Coverings and the 84-Shape
• The local minima in the lattice-simplex covering problem

Cites work

• scientific article; zbMATH DE number 480248 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• scientific article; zbMATH DE number 3056572 (Why is no real title available?)
• scientific article; zbMATH DE number 3094759 (Why is no real title available?)
• scientific article; zbMATH DE number 3104143 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Covering the plane with translates of a triangle
• Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
• Improved lower bounds on the degree-diameter problem
• Lattice-Simplex Coverings and the 84-Shape
• Moore graphs and beyond: a survey of the degree/diameter problem
• Mysteries in Packing Regular Tetrahedra
• New bounds on the density of lattice coverings
• On lattice coverings by simplices
• Packing, covering and tiling in two-dimensional spaces
• Packing, tiling, and covering with tetrahedra
• Research Problems in Discrete Geometry
• Sur la densité des réseaux de domaines convexes
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• The densest lattice packing of tetrahedra
• Upper bound on the packing density of regular tetrahedra and octahedra

Cited in

(4)

• Lattice Simplices with a Fixed Positive Number of Interior Lattice Points: A Nearly Optimal Volume Bound
• On lattice coverings by simplices
• Lower Bound on Translative Covering Density of Tetrahedra
• Lower bound on the translative covering density of octahedra

This page was built for publication: Lower Bounds on Lattice Covering Densities of Simplices

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