A computer verification of the Kepler conjecture

Simple item page
dc.creatorHales, Thomas C.
dc.date2003-05-01
dc.date.accessioned2026-07-07T04:57:38Z
dc.date.available2026-07-07T04:57:38Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/math/0305012
dc.identifierhttp://arxiv.org/abs/math/0305012
dc.identifierProceedings of the ICM, Beijing 2002, vol. 3, 795--804
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67330
dc.subjectMetric Geometry
dc.subject52C17
dc.titleA computer verification of the Kepler conjecture
dc.typetext

Files

Collections

arXiv