Convex and discrete geometry Packing and covering Concept
Kissing number
Summary
The kissing number is the largest number of non-overlapping unit balls in that can all touch one central unit ball. It is known exactly only in dimensions , , , , and , where it equals , , , , and . The problem is a close relative of sphere packing and of the theory of spherical codes.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | B408FZYXF9 |
|---|---|
| URI | m2://B408FZYXF9 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C17, 05B40, 11H31 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.