Related papers: A nonsmooth program for jamming hard spheres
We study the octahedral configurations $O_6$ of six equal cylinders touching the unit sphere. We show that the configuration $O_6$ is a local sharp maximum of the distance function. Thus it is not unlockable and, moreover, rigid.
Jammed disordered packings of non-spherical particles show significant variation in the packing density as a function of particle shape for a given packing protocol. Rotationally symmetric elongated shapes such as ellipsoids,…
We prove that the least area of the non-contractible immersed spheres is no more than $4\pi$ in any oriented compact manifold with dimension $n+2\leq 7$ which satisfies $R\geq 2$ and admits a map to $\mathbf S^2\times T^n$ with nonzero…
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…
As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…
This paper deals with the generalization of usual round spheres in the flat Minkowski spacetime to the case of a generic four-dimensional spacetime manifold $M$. We consider geometric properties of sphere-like submanifolds in $M$ and…
There are two main classes of physics-based models for two-dimensional cellular materials: packings of repulsive disks and the vertex model. These models have several disadvantages. For example, disk interactions are typically a function of…
We numerically study the jamming transition of frictionless polydisperse spheres in three dimensions. We use an efficient thermalisation algorithm for the equilibrium hard sphere fluid and generate amorphous jammed packings over a range of…
The adsorption of particles diffusing in a half-space bounded by the substrate and irreversibly sticking to the substrate upon contacts is investigated. We show that when absorbing particles are planar disks diffusing in the…
We introduce a generalization of classical $q$-ary codes by allowing points to cover other points that are Hamming distance $1$ or $2$ in a freely chosen subset of all directions. More specifically, we generalize the notion of $1$-covering,…
We relate the structure factor $S(\mathbf{k} \to \mathbf{0})$ in a system of jammed hard spheres of number density $\rho$ to its complexity per particle $\Sigma(\rho)$ by the formula $S(\mathbf{k} \to \mathbf{0})=-1/…
We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…
We identify putatively maximally dense packings of tangent-sphere trimers with fixed bond angles ($\theta = \theta_0$) using a novel method, and contrast them to the disordered jammed states they form under quasistatic and dynamic athermal…
The exploration of the densest sphere packings is a fundamental problem in mathematics and a wide variety of sciences including materials science. We present our exhaustive computational exploration of the densest ternary sphere packings…
We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…
We define \emph{piecewise rank 1} manifolds, which are aspherical manifolds that generally do not admit a nonpositively curved metric but can be decomposed into pieces that are diffeomorphic to finite volume, irreducible, locally symmetric,…
Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…
We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints.…
We use molecular simulations to study jamming of a crumpled bead-spring model polymer in a finite container and compare to jamming of repulsive spheres. After proper constraint counting, the onset of rigidity is seen to occur isostatically…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…