Related papers: Comment on "Explicit Analytical Solution for Rando…
In this thesis I present most of the results obtained during my PhD, where I worked on different subjects regarding jamming in systems of frictionless spheres. In particular, I focused on microscopic properties of jammed packings, such as…
We present a statistical mechanical description of randomly packed spherical particles, where the average coordination number is treated as a macroscopic thermodynamic variable. The overall packing entropy is shown to have two…
In this paper, the binary random packing fraction of similar particles with size ratios ranging from unity to well over 2 is studied. The classic excluded volume model for spherocylinders and cylinders proposed by Onsager [1] is revisited…
In jammed packings, it is usually thought that local structure only plays a significant role in specific regimes. The standard deviation of the relative excess coordination, $\sigma_Z/ Z_\mathrm{c}$, decays like $1/\sqrt{d}$, so that local…
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 present a comprehensive pedagogical introduction to the dimensional reduction protocol (DRP), a versatile framework for analyzing instabilities and critical points in interacting fermionic systems. The DRP simplifies the study of…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
The Geometric Bin Packing (GBP) problem is a generalization of Bin Packing where the input is a set of $d$-dimensional rectangles, and the goal is to pack them into unit $d$-dimensional cubes efficiently. It is NP-Hard to obtain a PTAS for…
We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…
We numerically study the structure of the interactions occurring in three-dimensional systems of hard spheres at jamming, focusing on the large-scale behavior. Given the fundamental role they play in the configuration of jammed packings, we…
We numerically analyse the density field of three-dimensional randomly jammed packings of monodisperse soft frictionles spherical particles, paying special attention to fluctuations occurring at large lengthscales. We study in detail the…
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…
In the Minimum $d$-Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into $\mathbb{Z}^d$ (for some fixed dimension $d\geq 1$) minimizing the total weighted…
We investigate a real-life air cargo loading problem which is a variant of the three-dimensional Variable Size Bin Packing Problem with special bin forms of cuboid and non-cuboid unit load devices (ULDs). Packing is constrained by…
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…
This is the first paper of a series of three, reporting on numerical simulation studies of geometric and mechanical properties of static assemblies of spherical beads under an isotropic pressure. Frictionless systems assemble in the unique…
Hyperuniformity characterizes a state of matter that is poised at a critical point at which density or volume-fraction fluctuations are anomalously suppressed at infinite wavelengths. Recently, much attention has been given to the link…
We suggest a tight inequality for norms in $d$-dimensional space $l_p $ which has simple formulation but appears hard to prove. We give a proof for $d=3$ and provide a detailed numerical check for $d\leq 200$ confirming the conjecture. We…
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…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…