Indexed metadata
A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five
Sven Ahrend, Mathieu Dutour Sikirić
Source abstract
The packing-covering constant of a point set is , the covering radius divided by the packing radius. Among lattices, its minimum is known for , attained by , , and Horváth's lattices , ; Böröczky proved that is optimal without the lattice restriction, but for the non-lattice problem was open. We exhibit a -periodic non-lattice point set of with , so that in dimension five the packing-covering problem is not solved by lattices.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.