Related papers: A Linear Programming Algorithm to Test for Jamming…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
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…
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are…
We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…
An outstanding question in the physics of soft jammed packings concerns the nature of the correlations that arise near the unjamming transition. In this work, we treat unjamming as a constraint satisfaction problem and demonstrate that a…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
O'Hern, Silbert, Liu and Nagel [Phys. Rev. E. 68, 011306 (2003)] (OSLN) claim that a special point $J$ of a "jamming phase diagram" (in density, temperature, stress space) is related to random close packing of hard spheres, and that it…
Amorphous packings of non-spherical particles such as ellipsoids and spherocylinders are known to be hypostatic: the number of mechanical contacts between particles is smaller than the number of degrees of freedom, thus violating Maxwell's…
We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…
The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…
Athermal packings of soft repulsive spheres exhibit a sharp jamming transition in the thermodynamic limit. Upon further compression, various structural and mechanical properties display clean power-law behavior over many decades in…
We study jamming in granular mixtures from the novel point of view of extended hydrodynamics. Using a hard sphere binary mixture model we predict that a few large grains are expected to get caged more effectively in a matrix of small grains…
A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…
We propose a theoretical framework for predicting the protocol dependence of the jamming transition for frictionless spherical particles that interact via purely repulsive contact forces. We study isostatic jammed disk packings obtained via…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
Hyperuniformity characterizes a state of matter for which density fluctuations diminish towards zero at the largest length scales. However, the task of determining whether or not an experimental system is hyperuniform is experimentally…
We consider a system of hard spheres close to jamming, where translation invariance is broken by pinning a randomly chosen set of particles. Using two different protocols, we generate two kinds of packings at the jamming point, isostatic…
Granular systems are not always homogeneous and can be composed of grains with very different mechanical properties. To improve our understanding of the behavior of real granular systems, in this experimental study, we compress 2D…
Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…