Related papers: Comment on "Explicit Analytical Solution for Rando…
In a recent paper (cond-mat/0506445) we derived an expression for the replicated free energy of a liquid of hard spheres based on the HNC free energy functional. An approximate equation of state for the glass and an estimate of the random…
This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…
Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work, we show that the lower bound on the…
We report calculations of the density of maximally random jamming (aka random close packing) of one-component and binary hard disc fluids. The theoretical structure used provides a common framework for description of the hard disc liquid to…
In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square…
We present a perfect simulation of the hard disks model via the partial rejection sampling method. Provided the density of disks is not too high, the method produces exact samples in $O(\log n)$ rounds, and total time $O(n)$, where $n$ is…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
We propose an improved viscosity model accounting for experiments of emulsions of two immiscible liquids at arbitrary volume fractions and low shear rates. The model is based on a recursive-differential method formulated in terms of the…
The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
The structural properties of single component fluids of hard hyperspheres in odd space dimensionalities $d$ are studied with an analytical approximation method that generalizes the Rational Function Approximation earlier introduced in the…
We investigate the nature of randomness in disordered packings of frictional spheres. We calculate the entropy of 3D packings through the force and volume ensemble of jammed matter, a mesoscopic ensemble and numerical simulations using…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…
It is commonly believed that the most efficient way to pack a finite number of equal-sized spheres is by arranging them tightly in a cluster. However, mathematicians have conjectured that a linear arrangement may actually result in the…
We adapt a recent theory for the random close packing of polydisperse spheres in three dimensions [R. S. Farr and R. D. Groot, J. Chem. Phys. {\bf 131} 244104 (2009)] in order to predict the Hausdorff dimension $d_{A}$ of the Apollonian…
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…
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…