Formalizing the Proof of the Kepler Conjecture
Lecture Notes in Computer Science(2004)
摘要
The Kepler Conjecture states that the densest packing of spheres in three dimensions is the familiar cannonball arrangement.
Although this statement has been regarded as obvious by chemists, a rigorous mathematical proof of this fact was not obtained
until 1998.
The mathematical proof of the Kepler Conjecture runs 300 pages, and relies on extensive computer calculations. The refereeing
process involved more than 12 referees over a five year period. This talk will describe the top-level structure of the proof
of this theorem. The proof involves methods of linear and non-linear optimization, and arguments from graph theory and discrete
geometry. In view of the complexity of the proof and the difficulties that were encountered in refereeing the proof, it seems
desirable to have a formal proof of this theorem. This talk will give details about what would be involved in giving a formal
proof of this result.
更多查看译文
关键词
graph theory,three dimensions,discrete geometry
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要