New upper bounds on sphere packings. I (Q1425322): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Noam D. Elkies / rank | |||
Property / reviewed by | |||
Property / reviewed by: Alexey R. Alimov / rank | |||
Property / author | |||
Property / author: Noam D. Elkies / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Alexey R. Alimov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3104302389 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56288680 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0110009 / rank | |||
Normal rank |
Latest revision as of 20:19, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New upper bounds on sphere packings. I |
scientific article |
Statements
New upper bounds on sphere packings. I (English)
0 references
16 March 2004
0 references
The authors develop an analogue for sphere packing (the densest packing of Euclidean spheres into Euclidean space) of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. The methods used here are not limited to studying Euclidean sphere packings, but can be applied to translations of arbitatry symmetrical convex bodies \(C\). The main result: Suppose \(f:{\mathbb R}^n \to {\mathbb R}\) is an admissible function, \(f\neq 0\), and \(f(x) \geq 0\) for \(x\notin C\) and \(\widehat f(t)\geq 0\) for all \(t\). Then all packings with translates of \(C\) have density bounded above by \((\text{vol} (C) f(0))/(2^n \widehat f(0))\). The authors conjecture that their approach can be used to solve the sphere packing problem in dimensions 8 and~24.
0 references
sphere packing
0 references
error-correcting code
0 references
linear programming bound
0 references