Kissing Number

(Discrete Geometry)


Discrete Geometry
Link to Dbpedia

What is Kissing number?

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. 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. 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.

Technology Types

discrete geometrypacking problem


Kissing number problemKissing spheresSphere kissing problem


Kusgetal (nl)Kusszahl (de)Número de osculação (pt)Número de osculación (es)Контактное число (ru)مسألة عدد التقبيل (ar)입맞춤 수 문제 (ko)接吻数問題 (ja)

Tech Info

Source: [object Object]
 — Date merged: 11/6/2021, 1:32:50 PM
 — Date scraped: 5/20/2021, 5:43:45 PM