Math 2.0

Convex and discrete geometry Packing and covering Concept

Kissing number

Summary

The kissing number τ(n)\tau(n) is the largest number of non-overlapping unit balls in ℝn\R^n that can all touch one central unit ball. It is known exactly only in dimensions 11, 22, 33, 44, 88 and 2424, where it equals 22, 66, 1212, 2424, 240240 and 196560196560. 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

  1. Web https://en.wikipedia.org/wiki/Kissing_number
About this page
TagB408FZYXF9
URIm2://B408FZYXF9
Kindconcept
WritingW0 stub
MSC52C17, 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.

What links here

Used by

Definitions

Results about this