The Honeycomb Problem on the Sphere

Simple item page
dc.creatorHales, Thomas C.
dc.date2002-11-15
dc.date.accessioned2026-07-07T04:52:57Z
dc.date.available2026-07-07T04:52:57Z
dc.descriptionThe honeycomb problem on the sphere asks for the perimeter-minimizing partition of the sphere into N equal areas. This article solves the problem when N=12. The unique minimizer is a tiling of 12 regular pentagons in the dodecahedral arrangement.
dc.identifierhttps://arxiv.org/abs/math/0211234
dc.identifierhttp://arxiv.org/abs/math/0211234
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65665
dc.subjectMetric Geometry
dc.titleThe Honeycomb Problem on the Sphere
dc.typetext

Files

Collections

arXiv