Related papers: Enumerating rigid sphere packings
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
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…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
A significant range of geometric structures whose rigidity is explored for both practical and theoretical purposes are formed by modifying generically isostatic triangulated spheres. In the block and hole structures (P, p), some edges are…
The average distance of the equal hard spheres is introduced to evaluate the density of a given arrangement. The absolute smallest value is two radii because the spheres can not be closer to each other than their diameter. The absolute…
We show that the optimal packing of hard spheres in an infinitely long cylinder yields structures characterised by a screw symmetry. Each packing can be assembled by stacking a basic unit cell ad infinitum along the length of the cylinder…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
Continuing on recent computational and experimental work on jammed packings of hard ellipsoids [Donev et al., Science, vol. 303, 990-993] we consider jamming in packings of smooth strictly convex nonspherical hard particles. We explain why…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
The mechanical, optical, and chemical properties of a wide variety of soft materials are enabled and constrained by their bulk structure. How this structure emerges at small system sizes during self-assembly has been the subject of decades…
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be…
We use numerical simulations to show how noninteracting hard particles binding to a deformable elastic shell may self-assemble into a variety of linear patterns. This is a result of the nontrivial elastic response to deformations of shells.…
Soft-granular media, such as dense emulsions, foams or tissues, exhibit either fluid- or solid-like properties depending on the applied external stresses. Whereas bulk rheology of such materials has been thoroughly investigated, the…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly…
We study theoretically and numerically the microscopic cause of the mechanical stability of hard sphere glasses near their maximum packing. We show that, after coarse-graining over time, the hard sphere interaction can be described by an…
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…
A set of $n$-lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an $n$-cluster (in $\mathbb{R}^2$). We determine the smallest existent…