Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.cam.2013.03.036 | Journal of Computational and Applied Mathematics |
Keywords | Field | DocType |
Discrete geometry,Linear programming,Computer aided proof | Discrete geometry,Mathematical optimization,Isomorphism,Linear programming,SPHERES,Kissing number problem,Mathematics,Unit sphere | Journal |
Volume | ISSN | Citations |
254 | 0377-0427 | 1 |
PageRank | References | Authors |
0.52 | 2 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lisa Flatley | 1 | 3 | 1.34 |
Alexey Tarasov | 2 | 28 | 3.54 |
Martin Taylor | 3 | 6 | 1.48 |
Florian Theil | 4 | 14 | 5.66 |