开普勒猜想的计算机验证
A computer verification of the Kepler conjecture
摘要：
开普勒猜想断言三维全等球的堆积密度永远不会大于$π/\sqrt{18}$。1998年，计算机辅助验证证实了这一猜想。本文对这个问题进行了历史性的介绍。它描述了将此问题转化为有限变量的最优化问题的过程以及用于解决此最优化问题的策略。
英文摘要：
The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than $π/\sqrt{18}$. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
