Lower Bounds on Lattice Covering Densities of Simplices

DOI10.1137/22M1514155zbMATH Open1530.52009arXiv2202.06025OpenAlexW4385723600MaRDI QIDQ6046813FDOQ6046813

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)

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$.

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

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

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)

Cites Work

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

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)