Lower Bounds on Lattice Covering Densities of Simplices

DOI10.1137/22m1514155zbMath1530.52009arXiv2202.06025OpenAlexW4385723600MaRDI QIDQ6046813

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

simplexlattice coveringdegree-diameter problem

Mathematics Subject Classification ID

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

Cites Work

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

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