In the Euclidean plane one can pack the unit circles in such a way that every circle touches the maximal six neighbors, and the corresponding hexagonal arrangement is unique up to congruence. It is natural to ask the similar questions for sphere packing in the physical space, and it turns out that even the maximality of touching neighbors for local arrangement already constitutes a challenging problem in classical solid geometry, namely, “the problem of the thirteen spheres”. It was originated from an unpublished recorded discussion between David Gregory and Isaac Newton in 1694, and the solution was not correctly settled to be twelve until 1953. We will give a comparative analysis on three different proofs on the impossibility of thirteen ...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
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...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
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...
The densest known packing of 15 congruent circles on a sphere occurs in two equally dense varieties....
The classical circle packing problem asks for an arrangement of non-overlapping circles in the plan...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
AbstractThe purpose of this note is to present an elementary proof of the fact that no more than twe...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
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...
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can s...
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...
The densest known packing of 15 congruent circles on a sphere occurs in two equally dense varieties....
The classical circle packing problem asks for an arrangement of non-overlapping circles in the plan...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
A table is given of putative solutions to the Fejes problem: to find the maximum value of the smalle...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
AbstractThe purpose of this note is to present an elementary proof of the fact that no more than twe...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
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...