TOPICS
Search

Kissing Number


KissingNumber12

The kissing number tau_n is the largest number of congruent nonoverlapping hyperspheres in n-dimensional Euclidean space that can touch a congruent central hypersphere. It is also called the Newton number, contact number, coordination number, or ligancy. Equivalently, the points of tangency form a spherical code on S^(n-1) with pairwise angles of at least 60 degrees. In the standard notation for spherical codes,

 tau_n=A(n,1/2).

The three-dimensional problem was discussed by Newton and David Gregory in 1694. Newton asserted that 12 spheres could touch the central sphere, while Gregory considered whether 13 might be possible. A configuration of 12 is obtained by placing the points of tangency at the polyhedron vertices of a regular icosahedron, but enough space remains to make the impossibility of a 13th sphere far from visually obvious. The first generally accepted proof that tau_3=12 was published by Schütte and van der Waerden (1953), followed by a shorter proof by Leech (1956).

KissingNumberLargerHole

The asymmetric kissing configuration shown above creates a larger hole containing a smaller sphere of radius r=6sqrt(3)/7-1=0.4846149779.... This smaller sphere touches the central sphere and four surrounding spheres. Since r<1, it does not provide a 13th unit sphere.

The exact values currently known are tau_1=2, tau_2=6, tau_3=12, tau_4=24, tau_8=240, and tau_(24)=196560 (OEIS A257479). Musin (2008) proved tau_4=24 using a modification of Delsarte's method. The values for n=8 and 24 are realized by the E_8 root lattice and the Leech lattice, respectively (Odlyzko and Sloane 1979). For every other n>2, the exact value remains unknown.

The following table gives the best general lower bounds L_n and upper bounds U_n known for n<=24 as of August 2026; equal entries are exact (Cohn). Cohn's continuously maintained table at https://cohn.mit.edu/kissing-numbers/ lists current lower bounds and upper bounds in these and higher dimensions, with references for each bound.

nL_nU_nnL_nU_n
1221311542064
2661419323174
312121525644853
424241643207320
5404417573010978
6727718765416406
7126134191194824417
8240240201944836195
9306363212976853524
10510553224989680810
115938682393150122351
12840135524196560196560

As n->infty, an AI-generated proof given by OpenAI (2026) established

 tau_n<=2^((0.39661+o(1))n),

where o(1) is little-o notation. This improves the optimized classical exponent 0.400944... of Kabatyanskii and Levenshtein (1978).

Ho (2026) constructed 11948 kissing spheres in dimension 19 using a 1280-word subcode of a punctured binary Golay code. On the ambient 4096-word binary code, the graph joining codewords at Hamming distance below 5 consists of four identical parts with no edges between them. In each part, grouping the codewords into cosets of size 64 gives the Clebsch graph, where two cosets are joined when an edge joins their members. A five-element independent vertex set in that graph therefore gives 320 codewords in each part, for 1280 in total.

Kolosov (2026) proved that the 1280-word added-vector code in Ho's 19-dimensional construction is optimal among subsets of the specified 4096-word binary code with minimum Hamming distance at least 5. The upper bound partitions the code into 256 classes whose forbidden-distance graphs are Clebsch graphs, each with independence number 5. This establishes optimality within that code and does not give an upper bound of 11948 for the unrestricted 19-dimensional kissing number. The proof was co-developed with AI and its exact certificate was replayed by VibeMathed (2026), but independent specialist review had not been reported as of Sep. 7, 2026.

Allowing different ball radii leads to the average kissing number, which takes the supremum of the average contact degree over finite ball packings. Bockhaus and Glazyrin (2026) proved that this quantity equals the kissing number in dimensions 8 and 24.

Lin (2026, p. 1) constructed kissing configurations in dimensions 32-35 and 37-39. The construction in dimension 38 adds antipodal pairs of vectors from the Leech lattice. The other constructions use binary constant-weight codes. Lin reports that Claude developed and ran the searches and wrote the exact verification programs.

Kamenetsky (2026) constructed the following lower bounds in dimensions 49 through 61. They are bounds for the unrestricted kissing number, not asserted exact values.

dlower bound for tau_d
4952,430,388
5052,459,164
5152,502,324
5252,588,576
5352,703,384
5452,932,310
5553,316,308
5654,117,390
5754,574,792
5855,960,474
5956,583,474
6057,573,374
6160,057,914

Kamenetsky (2026) reports that an AI agent wrote and executed the mathematical search and exact verification code, and that the author checked the code and distributed certificates.


See also

Coxeter-Todd Lattice, Dodecahedral Conjecture, Hypersphere Packing, Kepler Conjecture, Leech Lattice, Sphere Packing, Spherical Code

Explore with Wolfram|Alpha

References

Bender, C. "Bestimmung der grössten Anzahl gleich Kugeln, welche sich auf eine Kugel von demselben Radius, wie die übrigen, auflegen lassen." Archiv Math. Physik (Grunert) 56, 302-306, 1874.Bockhaus, M. and Glazyrin, A. "New Upper Bounds for Average Kissing Numbers." 27 Oct 2026. https://arxiv.org/abs/2610.36675.Cohn, H. "Kissing Numbers." https://cohn.mit.edu/kissing-numbers/.Conway, J. H. and Sloane, N. J. A. "The Kissing Number Problem" and "Bounds on Kissing Numbers." §1.2 and Ch. 13 in Sphere Packings, Lattices, and Groups, 2nd ed. New York: Springer-Verlag, pp. 21-24 and 337-339, 1993.Edel, Y.; Rains, E. M.; and Sloane, N. J. A. "On Kissing Numbers in Dimensions 32 to 128." Elec. J. Combin. 5, R22, 1998. https://doi.org/10.37236/1360.Günther, S. "Ein stereometrisches Problem." Archiv Math. Physik 57, 209-215, 1875.Ho, B. S. "A New Lower Bound for the Kissing Number in 19 Dimensions." 11 Mar 2026. https://arxiv.org/abs/2603.10425.Hoppe, R. "Bemerkung der Redaction." Archiv Math. Physik. (Grunert) 56, 307-312, 1874.Sloane, N. J. A. Sequences A001116/M1585 and A257479 in "The On-Line Encyclopedia of Integer Sequences."Kabatyanskii, G. A. and Levenshtein, V. I. "Bounds for Packing on a Sphere and in Space." Problems Inform. Transm. 14, 1-17, 1978.Kamenetsky, D. "Improved Lower Bounds for the Kissing Number in Dimensions 49 to 61." 1 Nov 2026. https://arxiv.org/abs/2611.01906v1.Kolosov, A. M. "Optimality of the Added-Vector Code in the 19-Dimensional Kissing Construction." 2026. https://github.com/cheptil/kissing-number-19-dimensions.Kuperberg, G. "Average Kissing Numbers for Sphere Packings." Preprint.Kuperberg, G. and Schramm, O. "Average Kissing Numbers for Non-Congruent Sphere Packings." Math. Res. Let. 1, 339-344, 1994.Leech, J. "The Problem of Thirteen Spheres." Math. Gaz. 40, 22-23, 1956.Lin, Q. "New Lower Bounds for Kissing Numbers in Dimensions 32-35 and 37-39." 22 Oct 2026. https://arxiv.org/abs/2611.03682v1.Musin, O. R. "The Kissing Number in Four Dimensions." Ann. Math. 168, 1-32, 2008. https://doi.org/10.4007/annals.2008.168.1.Numberphile. "Kissing Numbers." Oct. 10, 2018. https://www.youtube.com/watch?v=LZ7X_YOfJqY.Odlyzko, A. M. and Sloane, N. J. A. "New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions." J. Combin. Th. A 26, 210-214, 1979.OpenAI. "Improved Bounds for Binary and Spherical Codes." Ch. 2 in Ten Advances in Mathematics and Theoretical Computer Science. Aug. 1, 2026. https://cdn.openai.com/pdf/ten-proofs-oai.pdf.Pfender, F. and Ziegler, G. "Kissing Numbers, Sphere Packings, and Some Unexpected Proofs." Not. Amer. Math. Soc. 51, 873-883, 2004.Schütte, K. and van der Waerden, B. L. "Das Problem der dreizehn Kugeln." Math. Ann. 125, 325-334, 1953.Stewart, I. The Problems of Mathematics, 2nd ed. Oxford, England: Oxford University Press, pp. 82-84, 1987.VibeMathed. "Optimality of the Added-Vector Code in the 19-Dimensional Kissing Construction." Sep. 6, 2026. https://vibemathed.com/problem/optimality-of-the-added-vector-code-in-the-19-dimensional-kissing-construction.Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, p. 84, 1986.Zinov'ev, V. A. and Ericson, T. "New Lower Bounds for Contact Numbers in Small Dimensions." Prob. Inform. Transm. 35, 287-294, 1999.Zong, C. and Talbot, J. Sphere Packings. New York: Springer-Verlag, 1999.

Referenced on Wolfram|Alpha

Kissing Number

Cite this as:

Weisstein, Eric W. "Kissing Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/KissingNumber.html

Subject classifications