Kissing Number Problem and Its Applications
碩士 === 東海大學 === 數學系 === 99 === Kissing number k(n) is the highest number of equal nonoverlapping spheres in Rn that can touch another sphere of the same size. In this paper, we discussed the kissing number problem of dimension three and four. That is, we discussed how many unit balls can kiss a fixe...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/19187247558757781911 |
| Summary: | 碩士 === 東海大學 === 數學系 === 99 === Kissing number k(n) is the highest number of equal nonoverlapping spheres
in Rn that can touch another sphere of the same size. In this paper, we discussed
the kissing number problem of dimension three and four. That is, we discussed how
many unit balls can kiss a fixed ball.
Finally, we introduce applications of three dimension in chemistry and crystallography.
The kissing number problem is the foundation of sphere packing problem.
In mathematics, sphere packing problems concern arrangements of nonoverlapping
identical spheres which fill a space. Using the conclusion of k(3) and apply it to the
complex sphere packing problem.
|
|---|