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 classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
We find all the locally maximally dense packings of 1 to 6 equal circles on the quotient of the Eucl...
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
The focus of this thesis lies on geometric packings of non-spherical shapes in three-dimensional Euc...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
In this paper, we study the sphere packing problem in Euclidean space, where we impose additional co...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
Abstract. In this note we give a simple proof of the classical fact that the hexagonal lattice gives...
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highe...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
We find all the locally maximally dense packings of 1 to 6 equal circles on the quotient of the Eucl...
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
The focus of this thesis lies on geometric packings of non-spherical shapes in three-dimensional Euc...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
In this paper, we study the sphere packing problem in Euclidean space, where we impose additional co...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
Abstract. In this note we give a simple proof of the classical fact that the hexagonal lattice gives...
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highe...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
We find all the locally maximally dense packings of 1 to 6 equal circles on the quotient of the Eucl...
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m...