期刊
DISCRETE & COMPUTATIONAL GEOMETRY
卷 44, 期 1, 页码 1-34出版社
SPRINGER
DOI: 10.1007/s00454-009-9148-4
关键词
Formal proof; Sphere packings; Linear programming; Interval analysis; Higher order logic; Hypermap
资金
- NSF [0804189]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0804189] Funding Source: National Science Foundation
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and complex. The process of revision and review did not end with the publication of the proof. This article summarizes the current status of a long-term initiative to reorganize the original proof into a more transparent form and to provide a greater level of certification of the correctness of the computer code and other details of the proof. A final part of this article lists errata in the original proof of the Kepler conjecture.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据