Packing twelve spherical caps to maximize tangencies

作者:

Highlights:

摘要

The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit sphere is given by the kissing number, k(3)=12. Here, we present a proof that the maximum number of tangencies in any kissing configuration is 24 and that, up to isomorphism, there are only two configurations for which this maximum is achieved. The result is motivated by a three-dimensional crystallization problem.

论文关键词:Discrete geometry,Linear programming,Computer aided proof

论文评审过程:Received 15 March 2013, Available online 26 March 2013.

论文官网地址:https://doi.org/10.1016/j.cam.2013.03.036