Indexed metadata

A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five

Sven Ahrend, Mathieu Dutour Sikirić

Source record

Source: arXiv

Published: Sep 24, 2026

arXiv: 2609.30513

Open original source ↗

Source abstract

The packing-covering constant of a point set X⊆RdX\subseteq\mathbb{R}^d is γ(X)=μ(X)/ρ(X)γ(X)=μ(X)/ρ(X), the covering radius divided by the packing radius. Among lattices, its minimum γdγ_d is known for d≤5d\leq 5, attained by A2∗\mathsf{A}_2^*, A3∗\mathsf{A}_3^*, and Horváth's lattices Ho4\mathsf{Ho}_4, Ho5\mathsf{Ho}_5; Böröczky proved that γ3γ_3 is optimal without the lattice restriction, but for d=4,5d=4,5 the non-lattice problem was open. We exhibit a 22-periodic non-lattice point set of R5\mathbb{R}^5 with γ=9/40=1.423024…<γ5=3/2+13/6=1.4494568…γ= 9/\sqrt{40} = 1.423024\ldots < γ_5 = \sqrt{3/2+\sqrt{13}/6} = 1.4494568\ldots, 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.