Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2016, Director: Juan Carlos Naranjo del ValThe kissing number problem is a classic problem related to the Kepler conjecture and which was already the subject of discussion between David Gregory and Isaac Newton. The problem asks for the value of $κ(n)$, which is the maximal number of equal radius and nonoverlapping spheres in n-dimensional space that can touch a fixed sphere of the same radius? The answer is known for n = 1, 2, 3, 4, 8, 24, in this work we will study the proof of Oleg R. Musin in the three dimensional case and discuss his strategy in the four dimensional one
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a centra...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These resul...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
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 ce...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
International audienceWe give a short review of existing mathematical programming based bounds for k...
AbstractDetermining the maximum number of D-dimensional spheres of radius r that can be adjacent to ...
The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit ...
L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kis...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a centra...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These resul...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
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 ce...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
Abstract. The “thirteen spheres problem, ” also know as the “Gregory-Newton problem” is to determine...
International audienceWe give a short review of existing mathematical programming based bounds for k...
AbstractDetermining the maximum number of D-dimensional spheres of radius r that can be adjacent to ...
The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit ...
L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kis...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a centra...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These resul...