arXiv (All)
open access
A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five
The packing-covering constant of a point set $X\subseteq\mathbb{R}^d$ is $γ(X)=μ(X)/ρ(X)$, the covering radius divided by the packing radius. Among lattices, its minimum $γ_d$ is known for $d\leq 5$, attained by $\mathsf{A}_2^*$, $\mathsf{A}_3^*$, and Horváth's lattices $\mathsf{Ho}_4$, $\mathsf{Ho}
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The sphere packing problem in dimension 24#974100
- Update to: Spectral sets: Numerical range and beyond#1037143
- On graphs with a unique minimum hull set#490208
- Finite Non-$p$-Groups with 5 Automorphism Orbits#1155721
- A comprehensive analysis of the Snellius-Pothenot problem#652223
Record · ID 1104712
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive