加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本