Related papers: A survey on the kissing numbers
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
How many unit $n-$dimensional spheres can simultaneously touch or kiss a central $n-$dimensional unit sphere? Beyond mathematics this question has implications for fields such as cryptography and the structure of biologic and chemical…
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…
Let H be a closed half-space of n-dimensional Euclidean space. Suppose S is a unit sphere in H that touches the supporting hyperplane of H. The one-sided kissing number B(n) is the maximal number of unit nonoverlapping spheres in H that can…
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.…
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
The kissing number $\tau(d)$ is the maximum number of pairwise non-overlapping unit spheres each touching a central unit sphere in the $d$-dimensional Euclidean space. In this note we report on how we discovered a new, previously unknown…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.
The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions that can touch another sphere of the same size. This number was the subject of a famous discussion between Isaac Newton and David Gregory…
Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in hyperbolic $\mathbb{H}^n$ and spherical $\mathbb{S}^n$ spaces, for $n\geq 2$. For that purpose, the kissing number is replaced by the…
This paper investigates the behaviour of the kissing number $\kappa(n, r)$ of congruent radius $r > 0$ spheres in $\mathbb{S}^n$, for $n\geq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $\kappa(n, r)$…
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density…
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3…
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on…
These lecture notes treat the solution of the kissing number problem in four dimesions which is based on an extension of the Delsarte method for spherical codes.