A computer verification of the Kepler conjecture
度量几何
2007-05-23 v1
摘要
The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than . A computer assisted verification confirmed this conjecture in 1998. This article gives a historical introduction to the problem. It describes the procedure that converts this problem into an optimization problem in a finite number of variables and the strategies used to solve this optimization problem.
引用
@article{arxiv.math/0305012,
title = {A computer verification of the Kepler conjecture},
author = {Thomas C. Hales},
journal= {arXiv preprint arXiv:math/0305012},
year = {2007}
}