The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit sphere is given by the kissing number, k(3)=12. Here, we present a proof that the maximum number of tangencies in any kissing configuration is 24 and that, up to isomorphism, there are only two configurations for which this maximum is achieved. The result is motivated by a three-dimensional crystallization problem
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) ...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid o...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice o...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
The Koebe circle packing theorem states that every finite planar graph can be realized as t...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kis...
International audienceWe give a short review of existing mathematical programming based bounds for k...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a centra...
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) ...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid o...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice o...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
The Koebe circle packing theorem states that every finite planar graph can be realized as t...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kis...
International audienceWe give a short review of existing mathematical programming based bounds for k...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a centra...
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) ...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid o...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice o...