Linear Programs for the Kepler Conjecture

DOI10.1007/978-3-642-15582-6_28MaRDI QIDQ5747875zbMATH OpenOpenAlexFDO

Authors Thomas C. Hales

Publication date 14 September 2010

Published in Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15582-6_28

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 2209729
• The O(1)-Kepler problems
• scientific article; zbMATH DE number 3963238
• The \(\mathrm{Sp}(1)\)-Kepler problems
• On the trajectories of \(\mathrm{O}(1)\)-Kepler problems
• Reduction and regularization of the Kepler problem
• On a family of Kepler problems with linear dissipation
• The \(\mathrm{U}(1)\)-Kepler problems
• On the regularization of the Kepler problem
• ON A STRONG VERSION OF THE KEPLER CONJECTURE

Cited in

(7)

• A replication crisis in mathematics?
• The Kepler Conjecture
• Efficient formal verification of bounds of linear programs
• A formal proof of the Kepler conjecture
• Theorem Proving in Higher Order Logics
• Theorem Proving in Higher Order Logics
• The O(1)-Kepler problems

Describes a project that uses

Uses Software

• GLPK
• Flyspeck
• kepler98

This page was built for publication: Linear Programs for the Kepler Conjecture

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