An approach to the dodecahedral conjecture based on bounds for spherical codes

DOI10.1007/978-3-319-00200-2_3zbMATH Open1275.52017OpenAlexW76503193MaRDI QIDQ2848990FDOQ2848990

Authors: 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

Recommendations

• The dodecahedral conjecture
• A proof of the Kepler conjecture
• The strong dodecahedral conjecture and Fejes Tóth's conjecture on sphere packings with kissing number twelve
• Sphere packings. IV: Detailed bounds
• Isoperimetric Inequalities and the Dodecahedral Conjecture

zbMATH Keywords

spherical codesDelsarte boundKepler conjecturedodecahedral conjecturesemidefinite programmin

Mathematics Subject Classification ID

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

Cites Work

• Dense sphere packings. A blueprint for formal proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spherical codes and designs
• New upper bounds for kissing numbers from semidefinite programming
• The thirteen spheres: a new proof
• The dodecahedral conjecture
• Tables of sphere packings and spherical codes
• Über die dichteste Kugellagerung

Cited In (4)

• Improved Delsarte bounds for spherical codes in small dimensions
• Title not available (Why is that?)
• The dodecahedral conjecture
• Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes

Uses Software

• Flyspeck

This page was built for publication: An approach to the dodecahedral conjecture based on bounds for spherical codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848990)