An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes

DOI10.1007/978-3-319-00200-2_3zbMath1275.52017OpenAlexW76503193MaRDI QIDQ2848990

Kurt M. Anstreicher

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_3

zbMATH Keywords

spherical codesDelsarte boundKepler conjecturedodecahedral conjecturesemidefinite programmin

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Uses Software

• Flyspeck

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical codes and designs
• The thirteen spheres: a new proof
• Über die dichteste Kugellagerung
• New upper bounds for kissing numbers from semidefinite programming
• The dodecahedral conjecture
• Tables of sphere packings and spherical codes

This page was built for publication: An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes