Convex and discrete geometry Definition
Kissing number
Definition
Let . A kissing configuration in the Euclidean space is a finite set such that:
- for every ;
- for all distinct , where is the Euclidean distance.
The kissing number is the largest size of a kissing configuration in .
Remarks
The conditions say that the closed balls of radius centred at the points of touch the unit ball at and have pairwise disjoint interiors. Example: in , the six points for have norm , and neighbours are at distance exactly , so they form a kissing configuration; hence . Non-example: seven points of norm in cannot form one. Two of them make an angle less than at , and are then at distance less than . Equivalently, is the largest number of points on the unit sphere with pairwise angles at least . The lattice kissing number is the largest size of such a configuration when is the set of shortest nonzero vectors of a lattice, scaled to length .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Closed ball concept
- Euclidean distance concept
- Euclidean space object
- Kissing number definition
Further reading
About this page
| Tag | HWC3SQGCQ0 |
|---|---|
| URI | m2://HWC3SQGCQ0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C17, 05B40, 11H31 |
| Defines | Kissing number |
| Uses | Euclidean space, Closed ball, Euclidean distance |
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.
What links here
No page links to this page yet.