L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kissing number problem. Given a ball in $\mathbb{R}^d$, consider a family of balls touching it, and another family of balls touching the first family. Find the maximal possible number of balls in this arrangement, provided that no two balls intersect by interiors, and all balls are congruent. They showed that the answer for disks on the plane is $19$. They also conjectured that if there are three families of disks instead of two, the answer is $37$. In this paper we confirm this conjecture
International audienceIn this note we prove that for any compact subset S of a Busemann surface (S, ...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
Determining the maximum number of $D$-dimensional spheres of radius $r$ that can be adjacent to a ce...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) ...
Introduction Let P be a packing of n (round) balls in R 3 . (A packing of round balls, also known...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
The Koebe circle packing theorem states that every finite planar graph can be realized as t...
The average kissing number in ℝn is the supremum of the average degrees of contact graphs of packing...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit ...
International audienceWe give a short review of existing mathematical programming based bounds for k...
International audienceIn this note we prove that for any compact subset S of a Busemann surface (S, ...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
Determining the maximum number of $D$-dimensional spheres of radius $r$ that can be adjacent to a ce...
[Boyvalenkov Peter; Бойваленков Петър]; [Dodunekov Stefan;Додунеков Стефан]The maximum possible numb...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) ...
Introduction Let P be a packing of n (round) balls in R 3 . (A packing of round balls, also known...
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32...
The Koebe circle packing theorem states that every finite planar graph can be realized as t...
The average kissing number in ℝn is the supremum of the average degrees of contact graphs of packing...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
The maximum number of non-overlapping unit spheres in R3 that can simultaneously touch another unit ...
International audienceWe give a short review of existing mathematical programming based bounds for k...
International audienceIn this note we prove that for any compact subset S of a Busemann surface (S, ...
O número de contato do Rn (em inglês, kissing number) é o maior número de esferas de raio unitário e...
Determining the maximum number of $D$-dimensional spheres of radius $r$ that can be adjacent to a ce...