Related papers: The Sphere-Packing Problem
Using ideas of sphere packing problem we estimate the number of solid moons that can be packed inside the Earth, assuming that both the Moon and the Earth are perfect sphere.
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
We present a (possibly) new sphere eversion based on the contractibility* of a certain subset of the space of immersions of the circle in the plane. (*: by strong deformation retraction)
Random packings of objects of a particular shape are ubiquitous in science and engineering. However, such jammed matter states have eluded any systematic theoretical treatment due to the strong positional and orientational correlations…
Sphere packings are essential to the development of physical models for powders, composite materials, and the atomic structure of the liquid state. There is a strong scientific need to be able to assess the fit of packing models to data,…
A construction for sphere packings is introduced that is parallel to the ``anticode'' construction for codes. This provides a simple way to view Vardy's recent 20-dimensional sphere packing, and also produces packings in dimensions 22,…
Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made…
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…
We produce precise estimates for the Kogbetliantz kernel for the approximation of functions on the sphere. Furthermore, we propose and study a new approximation kernel, which has slightly better properties.
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
Recent works on the Dyadosphere are reviewed.
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…
This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
Free actions of finite groups on spheres give rise to topological spherical space forms. The existence and classification problems for space forms have a long history in the geometry and topology of manifolds. In this article, we present a…
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
We consider embeddings of a finite complex in a sphere. We give a homotopy theoretic classification of such embeddings in a wide range.
Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…
We investigate equal spheres packings generated from several experiments and from a large number of different numerical simulations. The structural organization of these disordered packings is studied in terms of the network of common…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…