In geometry, the **kissing number** of a mathematical space is defined as the greatest number of non-overlapping unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing (arrangement of spheres) in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another.

- Known greatest kissing numbers
- Some known bounds
- Generalization
- Algorithms
- Mathematical statement
- See also
- Notes
- References
- External links

Other names for kissing number that have been used are **Newton number** (after the originator of the problem), and **contact number**.

In general, the **kissing number problem** seeks the maximum possible kissing number for *n*-dimensional spheres in (*n* + 1)-dimensional Euclidean space. Ordinary spheres correspond to two-dimensional closed surfaces in three-dimensional space.

Finding the kissing number when centers of spheres are confined to a line (the one-dimensional case) or a plane (two-dimensional case) is trivial. Proving a solution to the three-dimensional case, despite being easy to conceptualise and model in the physical world, eluded mathematicians until the mid-20th century.^{ [1] }^{ [2] } Solutions in higher dimensions are considerably more challenging, and only a handful of cases have been solved exactly. For others investigations have determined upper and lower bounds, but not exact solutions.^{ [3] }

In one dimension,^{ [4] } the kissing number is 2:

In two dimensions, the kissing number is 6:

**Proof**: Consider a circle with center *C* that is touched by circles with centers *C*_{1}, *C*_{2}, .... Consider the rays *C**C*_{i}. These rays all emanate from the same center *C*, so the sum of angles between adjacent rays is 360°.

Assume by contradiction that there are more than six touching circles. Then at least two adjacent rays, say *C**C*_{1} and *C**C*_{2}, are separated by an angle of less than 60°. The segments *C C _{i}* have the same length – 2

In three dimensions, the kissing number is 12, but the correct value was much more difficult to establish than in dimensions one and two. 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 through a continuous movement 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 correctly thought that the limit was 12; Gregory thought that a 13th could fit. Some incomplete proofs that Newton was correct were offered in the nineteenth century, most notably one by Reinhold Hoppe, but the first correct proof (according to Brass, Moser, and Pach) did not appear until 1953.^{ [1] }^{ [2] }^{ [6] }

The twelve neighbors of the central sphere correspond to the maximum bulk coordination number of an atom in a crystal lattice in which all atoms have the same size (as in a chemical element). A coordination number of 12 is found in a cubic close-packed or a hexagonal close-packed structure.

In four dimensions, it was known for some time that the answer was either 24 or 25. It is straightforward to produce a packing of 24 spheres around a central sphere (one can place the spheres at the vertices of a suitably scaled 24-cell centered at the origin). As in the three-dimensional case, there is a lot of space left over—even more, in fact, than for *n* = 3—so the situation was even less clear. In 2003, Oleg Musin proved the kissing number for *n* = 4 to be 24, using a subtle trick.^{ [7] }^{ [8] }

The kissing number in *n* dimensions is unknown for *n* > 4, except for *n* = 8 (240), and *n* = 24 (196,560).^{ [9] }^{ [10] } The results in these dimensions stem from the existence of highly symmetrical lattices: the *E*_{8} lattice and the Leech lattice.

If arrangements are restricted to *lattice* arrangements, in which the centres of the spheres all lie on points in a lattice, then this restricted kissing number is known for *n* = 1 to 9 and *n* = 24 dimensions.^{ [11] } For 5, 6, and 7 dimensions the arrangement with the highest known kissing number found so far is the optimal lattice arrangement, but the existence of a non-lattice arrangement with a higher kissing number has not been excluded.

The following table lists some known bounds on the kissing number in various dimensions.^{ [12] } The dimensions in which the kissing number is known are listed in boldface.

Dimension | Lower bound | Upper bound |
---|---|---|

1 | 2 | |

2 | 6 | |

3 | 12 | |

4 | 24 ^{ [7] } | |

5 | 40 | 44 |

6 | 72 | 78 |

7 | 126 | 134 |

8 | 240 | |

9 | 306 | 363 |

10 | 500 | 553 |

11 | 582 | 869 |

12 | 840 | 1,356 |

13 | 1,154^{ [13] } | 2,066 |

14 | 1,606^{ [13] } | 3,177 |

15 | 2,564 | 4,858 |

16 | 4,320 | 7,332 |

17 | 5,346 | 11,014 |

18 | 7,398 | 16,469 |

19 | 10,668 | 24,575 |

20 | 17,400 | 36,402 |

21 | 27,720 | 53,878 |

22 | 49,896 | 81,376 |

23 | 93,150 | 123,328 |

24 | 196,560 |

The kissing number problem can be generalized to the problem of finding the maximum number of non-overlapping congruent copies of any convex body that touch a given copy of the body. There are different versions of the problem depending on whether the copies are only required to be congruent to the original body, translates of the original body, or translated by a lattice. For the regular tetrahedron, for example, it is known that both the lattice kissing number and the translative kissing number are equal to 18, whereas the congruent kissing number is at least 56.^{ [14] }

There are several approximation algorithms on intersection graphs where the approximation ratio depends on the kissing number.^{ [15] } For example, there is a polynomial-time 10-approximation algorithm to find a maximum non-intersecting subset of a set of rotated unit squares.

The kissing number problem can be stated as the existence of a solution to a set of inequalities. Let be a set of *N**D*-dimensional position vectors of the centres of the spheres. The condition that this set of spheres can lie round the centre sphere without overlapping is:^{ [16] }

Thus the problem for each dimension can be expressed in the existential theory of the reals. However, general methods of solving problems in this form take at least exponential time which is why this problem has only been solved up to four dimensions. By adding additional variables, this can be converted to a single quartic equation in *N*(*N*-1)/2 + *DN* variables:^{ [17] }

Therefore, to solve the case in *D* = 5 dimensions and *N* = 40 + 1 vectors would be equivalent to determining the existence of real solutions to a quartic polynomial in 1025 variables. For the *D* = 24 dimensions and *N* = 196560 + 1, the quartic would have 19,322,732,544 variables. An alternative statement in terms of distance geometry is given by the distances squared between the *m*^{th} and *n*^{th} sphere:

This must be supplemented with the condition that the Cayley–Menger determinant is zero for any set of points which forms an (*D* + 1) simplex in *D* dimensions, since that volume must be zero. Setting gives a set of simultaneous polynomial equations in just *y* which must be solved for real values only. The two methods, being entirely equivalent, have various different uses. For example, in the second case one can randomly alter the values of the *y* by small amounts to try to minimise the polynomial in terms of the *y*.

- 1 2 Conway, John H.; Neil J.A. Sloane (1999).
*Sphere Packings, Lattices and Groups*(3rd ed.). New York: Springer-Verlag. p. 21. ISBN 0-387-98585-9. - 1 2 Brass, Peter; Moser, W. O. J.; Pach, János (2005).
*Research problems in discrete geometry*. Springer. p. 93. ISBN 978-0-387-23815-9. - ↑ Mittelmann, Hans D.; Vallentin, Frank (2009). "High accuracy semidefinite programming bounds for kissing numbers".
*Experimental Mathematics*.**19**: 174–178. arXiv: 0902.1105 . Bibcode:2009arXiv0902.1105M. - ↑ Note that in one dimension, "spheres" are just pairs of points separated by the unit distance. (The vertical dimension of one-dimensional illustration is merely evocative.) Unlike in higher dimensions, it is necessary to specify that the interior of the spheres (the unit-length open intervals) do not overlap in order for there to be a finite packing density.
- ↑ See also Lemma 3.1 in Marathe, M. V.; Breu, H.; Hunt, H. B.; Ravi, S. S.; Rosenkrantz, D. J. (1995). "Simple heuristics for unit disk graphs".
*Networks*.**25**(2): 59. arXiv: math/9409226 . doi:10.1002/net.3230250205. - ↑ Zong, Chuanming (2008), "The kissing number, blocking number and covering number of a convex body", in Goodman, Jacob E.; Pach, J├ínos; Pollack, Richard (eds.),
*Surveys on Discrete and Computational Geometry: Twenty Years Later (AMS-IMS-SIAM Joint Summer Research Conference, June 18ÔÇô22, 2006, Snowbird, Utah)*, Contemporary Mathematics,**453**, Providence, RI: American Mathematical Society, pp. 529–548, doi:10.1090/conm/453/08812, ISBN 9780821842393, MR 2405694 . - 1 2 O. R. Musin (2003). "The problem of the twenty-five spheres".
*Russ. Math. Surv*.**58**(4): 794–795. Bibcode:2003RuMaS..58..794M. doi:10.1070/RM2003v058n04ABEH000651. - ↑ Pfender, Florian; Ziegler, Günter M. (September 2004). "Kissing numbers, sphere packings, and some unexpected proofs" (PDF).
*Notices of the American Mathematical Society*: 873–883.. - ↑ Levenshtein, Vladimir I. (1979). "О границах для упаковок в n-мерном евклидовом пространстве" [On bounds for packings in
*n*-dimensional Euclidean space].*Doklady Akademii Nauk SSSR*(in Russian).**245**(6): 1299–1303. - ↑ Odlyzko, A. M., Sloane, N. J. A.
*New bounds on the number of unit spheres that can touch a unit sphere in n dimensions.*J. Combin. Theory Ser. A 26 (1979), no. 2, 210—214 - ↑ Weisstein, Eric W. "Kissing Number".
*MathWorld*. - ↑ Machado, Fabrício C.; Oliveira, Fernando M. (2018). "Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry".
*Experimental Mathematics*.**27**: 362–369. arXiv: 1609.05167 . doi:10.1080/10586458.2017.1286273. - 1 2 В. А. Зиновьев, Т. Эриксон (1999). Новые нижние оценки на контактное число для небольших размерностей.
*Пробл. Передачи Информ.*(in Russian).**35**(4): 3–11. English translation: V. A. Zinov'ev, T. Ericson (1999). "New Lower Bounds for Contact Numbers in Small Dimensions".*Problems of Information Transmission*.**35**(4): 287–294. MR 1737742. - ↑ Lagarias, Jeffrey C.; Zong, Chuanming (December 2012). "Mysteries in packing regular tetrahedra" (PDF).
*Notices of the American Mathematical Society*: 1540–1549. - ↑ Kammer, Frank; Tholey, Torsten (July 2012). "Approximation Algorithms for Intersection Graphs".
*Algorithmica*.**68**(2): 312–336. doi:10.1007/s00453-012-9671-1. - ↑ Numbers
*m*and*n*run from 1 to*N*. is the sequence of the*N*positional vectors. As the condition behind the second universal quantifier () does not change if*m*and*n*are exchanged, it is sufficient to let this quantor extend just over . For simplification the sphere radiuses are assumed to be 1/2. - ↑ Concerning the matrix only the entries having
*m*<*n*are needed. Or, equivalent, the matrix can be assumed to be antisymmetric. Anyway the matrix has just*N*(*N*− 1)\2 free scalar variables. In addition, there are*N**D*-dimensional vectors*x*_{n}, which correspondent to a matrix of*N*column vectors.

**Packing problems** are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.

In mathematics, a **quadratic form** is a polynomial with terms all of degree two. For example,

In mathematics, the **Leech lattice** is an even unimodular lattice Λ_{24} in 24-dimensional Euclidean space, which is one of the best models for the kissing number problem. It was discovered by John Leech (1967). It may also have been discovered by Ernst Witt in 1940.

In geometry, a **sphere packing** is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions or to non-Euclidean spaces such as hyperbolic space.

**Discrete geometry** and **combinatorial geometry** are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.

In mathematics, the **linking number** is a numerical invariant that describes the linking of two closed curves in three-dimensional space. Intuitively, the linking number represents the number of times that each curve winds around the other. The linking number is always an integer, but may be positive or negative depending on the orientation of the two curves.

In geometry and group theory, a **lattice** in is a subgroup of the additive group which is isomorphic to the additive group , and which spans the real vector space . In other words, for any basis of , the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice. A lattice may be viewed as a regular tiling of a space by a primitive cell.

In mathematics, a **Kakeya set**, or **Besicovitch set**, is a set of points in Euclidean space which contains a unit line segment in every direction. For instance, a disk of radius 1/2 in the Euclidean plane, or a ball of radius 1/2 in three-dimensional space, forms a Kakeya set. Much of the research in this area has studied the problem of how small such sets can be. Besicovitch showed that there are Besicovitch sets of measure zero.

In geometry and combinatorics, an **arrangement of hyperplanes** is an arrangement of a finite set *A* of hyperplanes in a linear, affine, or projective space *S*. Questions about a hyperplane arrangement *A* generally concern geometrical, topological, or other properties of the **complement**, *M*(*A*), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice. The **intersection semilattice** of *A*, written *L*(*A*), is the set of all subspaces that are obtained by intersecting some of the hyperplanes; among these subspaces are *S* itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc.. These **intersection subspaces** of *A* are also called the **flats of***A*. The intersection semilattice *L*(*A*) is partially ordered by *reverse inclusion*.

In geometry, **close-packing of equal spheres** is a dense arrangement of congruent spheres in an infinite, regular arrangement. Carl Friedrich Gauss proved that the highest average density – that is, the greatest fraction of space occupied by spheres – that can be achieved by a lattice packing is

In coding theory, **block codes** are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples for block codes, many of which have a wide range of practical applications. The abstract definition of block codes is conceptually useful because it allows coding theorists, mathematicians, and computer scientists to study the limitations of *all* block codes in a unified way. Such limitations often take the form of *bounds* that relate different parameters of the block code to each other, such as its rate and its ability to detect and correct errors.

In mathematics, the **E _{8} lattice** is a special lattice in

In linear algebra, a **convex cone** is a subset of a vector space over an ordered field that is closed under linear combinations with positive coefficients.

In four-dimensional Euclidean geometry, the **16-cell honeycomb** is one of the three regular space-filling tessellations, represented by Schläfli symbol {3,3,4,3}, and constructed by a 4-dimensional packing of 16-cell facets, three around every face.

In four-dimensional Euclidean geometry, the **24-cell honeycomb**, or **icositetrachoric honeycomb** is a regular space-filling tessellation of 4-dimensional Euclidean space by regular 24-cells. It can be represented by Schläfli symbol {3,4,3,3}.

The **8-demicubic honeycomb**, or **demiocteractic honeycomb** is a uniform space-filling tessellation in Euclidean 8-space. It is constructed as an alternation of the regular 8-cubic honeycomb.

In geometry and polyhedral combinatorics, an **integral polytope** is a convex polytope whose vertices all have integer Cartesian coordinates. That is, it is a polytope that equals the convex hull of its integer points. Integral polytopes may also be called **convex lattice polytopes** or **Z-polytopes**. The special cases of two- and three-dimensional integral polytopes may be called polygons or polyhedra instead of polytopes, respectively.

In mathematics, a sequence of *n* real numbers can be understood as a location in *n*-dimensional space. When *n* = 8, the set of all such locations is called **8-dimensional space**. Often such spaces are studied as vector spaces, without any notion of distance. Eight-dimensional Euclidean space is eight-dimensional space equipped with the Euclidean metric.

A **sum-of-squares optimization** program is an optimization problem with a linear cost function and a particular type of constraint on the decision variables. These constraints are of the form that when the decision variables are used as coefficients in certain polynomials, those polynomials should have the polynomial SOS property. When fixing the maximum degree of the polynomials involved, sum-of-squares optimization is also known as the **Lasserre hierarchy** of relaxations in semidefinite programming.

In the mathematical fields of numerical analysis and approximation theory, **box splines** are piecewise polynomial functions of several variables. Box splines are considered as a multivariate generalization of basis splines (B-splines) and are generally used for multivariate approximation/interpolation. Geometrically, a box spline is the shadow (X-ray) of a hypercube projected down to a lower-dimensional space. Box splines and simplex splines are well studied special cases of polyhedral splines which are defined as shadows of general polytopes.

- T. Aste and D. Weaire
*The Pursuit of Perfect Packing*(Institute Of Physics Publishing London 2000) ISBN 0-7503-0648-3 - Table of the Highest Kissing Numbers Presently Known maintained by Gabriele Nebe and Neil Sloane (lower bounds)
- Bachoc, Christine; Vallentin, Frank (2008), "New upper bounds for kissing numbers from semidefinite programming",
*Journal of the American Mathematical Society*,**21**(3): 909–924, arXiv: math.MG/0608426 , doi:10.1090/S0894-0347-07-00589-9, MR 2393433

- Grime, James. "Kissing Numbers" (video).
*youtube*. Brady Haran . Retrieved 11 October 2018.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.