AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a regular tetrahedron T1 of side length 1 provides a 3-solid sphere-packing of any regular tetrahedron Tm derived by dilatation in the ratio m:1 from the centroid of T1. By means of a (permutation group) orbit method it is proved that that packing is locally optimal for differentiable perturbations. By means of an algebraic geometric method it is proved that the packing even is locally optimal for any small perturbation
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conduc...
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement o...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
We find all the locally maximally dense packings of 1 to 6 equal circles on the quotient of the Eucl...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highe...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
Abstract. In this note we give a simple proof of the classical fact that the hexagonal lattice gives...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
In 1900, as a part of his 18th problem, Hilbert asked the question to determine the density of the d...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conduc...
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement o...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
We find all the locally maximally dense packings of 1 to 6 equal circles on the quotient of the Eucl...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highe...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
Abstract. In this note we give a simple proof of the classical fact that the hexagonal lattice gives...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
In 1900, as a part of his 18th problem, Hilbert asked the question to determine the density of the d...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conduc...
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement o...