Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists and mathematicians for centuries. Here, we analytically construct the densest known packing of truncated tetrahedra with a remarkably high packing fraction φ = 207/208 = 0.995192..., which is amazingly close to unity and strongly implies its optimality. This construc...

We study the internal dynamical processes taking place in a granular packing below yield stress. At all packing fractions and down to vanishingly low applied shear, a logarithmic creep is observed. The experiments are analyzed using a viscoelastic model which introduces an internal, time-dependent, fluidity variable. For all experiments, the creep dynamics can be rescaled onto a unique curve wh...

We study the structure of numerically simulated hard sphere packings at different densities by investigating local tetrahedral configurations of the spheres. Clusters of tetrahedra adjacent by faces present relatively dense aggregates of spheres atypical for crystals. The number of spheres participating in such polytetrahedral configurations increases with densification of the packing, and at t...

At large packing fraction, disordered packings of particles with repulsive contact interactions jam into a rigid state where they withstand finite shear stresses before yielding. For frictionless particles at zero temperature, the Jamming transition coincides with the onset of iso-staticity. Various geometrical and mechanical properties exhibit critical behavior with the distance to Jamming. Wh...

The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic k-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably...

Although the concept of random close packing with an almost universal packing fraction of approximately 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing debates. The main difficulty in searching the densest packing is that states with packing fractions beyond the glass transition at approximately 0.58 are inherently non-equilibrium systems, where the dy...

This paper addresses the void fraction of polydisperse particles with a Weibull (or Rosin-Rammler) size distribution. It is demonstrated that the governing parameters of this distribution can be uniquely related to those of the lognormal distribution. Hence, an existing closed-form expression that predicts the void fraction of particles with a lognormal size distribution can be transformed into...

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

We study the 2-D and 3-D dynamic bin packing problem, in which items arrive and depart at arbitrary times. The 1-D problem was first studied by Coffman, Garey, and Johnson motivated by the dynamic storage problem. Bar-Noy et al. have studied packing of unit fraction items (i.e., items with length 1/k for some integer k ≥ 1), motivated by the window scheduling problem. In this paper, we extend t...