Kissing number problem Guide, Meaning , Facts, Information and Description
In geometry, the kissing number problem is to find the maximum number of spheres of radius 1 that can simultaneously touch the unit sphere in n-dimensional Euclidean space (or, with the restriction for their centres to be in a particular lattice).In one dimension, the answer is obviously 2:
It is easy to see (and to prove) that in two dimensions the answer is 6.
In three dimensions the answer is not so clear. It is easy to arrange 12 spheres so that each touches a central sphere, but there is a lot of space left over, and it is not obvious that there is no way to pack in a 13th sphere. (In fact, there is so much extra space that any two of the 12 outer spheres can exchange places without any of the outer spheres losing contact with the center one.) This was the subject of a famous disagreement between mathematicians Isaac Newton and David Gregory. Newton thought that the limit was 12, and Gregory that a 13th could fit. The question was not resolved until 1874; Newton was correct.
The kissing number in n dimensions is unknown for n>3, except for n=8 (240), and n=24 (196,560). For n=4, it has been known for some time that the answer is either 24 or 25. It is easy to produce a packing of 24 spheres around a central sphere, but as in the three-dimensional case, there is a lot of space left over---even more, in fact---so the situation is even less clear. In 24 dimensions, the kissing packing places the spheres at the points of the Leech lattice and there is no space at all left over.
Sphere packing, Lattice packing This is an Article on Kissing number problem. Page Contains Information, Facts Details or Explanation Guide About Kissing number problem Related articles