Related papers: A method for dense packing discovery
Particle tracking is a key to single-particle-level confocal microscopy observation of colloidal suspensions, emulsions, and granular matter. The conventional tracking method has not been able to provide accurate information on the size of…
We show for the first time that collectively jammed disordered packings of three-dimensional monodisperse frictionless hard spheres can be produced and tuned using a novel numerical protocol with packing density $\phi$ as low as 0.6. This…
Packing of particles in confined environments is a common problem in multiple fields. Here, based on the two-dimensional Hertzian particle model, we study the packing of deformable spherical particles under compression, and reveal the…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
The idea of using fragment embedding to circumvent the high computational scaling of accurate electronic structure methods while retaining high accuracy has been a long-standing goal for quantum chemists. Traditional fragment embedding…
Several variants of the recently proposed Density Matrix Embedding Theory (DMET) [G. Knizia and G. K-L. Chan, Phys. Rev. Lett. 109, 186404 (2012)] are formulated and tested. We show that spin symmetry breaking of the lattice mean-field…
In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…
3D microscopy is key in the investigation of diverse biological systems, and the ever increasing availability of large datasets demands automatic cell identification methods that not only are accurate, but also can imply the uncertainty in…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
A toy model of particles packings is presented, which consists in arranging hexagons on a triangular lattice according to local stability rules. The number of stable packings is analytically computed and found to grow exponentially with the…
The article explores an encoding and structural information processing approach using sparse bit vectors and fixed-length linear vectors. The following are presented: a discrete method of speculative stochastic dimensionality reduction of…
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
All hard, convex shapes are conjectured by Ulam to pack more densely than spheres, which have a maximum packing fraction of {\phi} = {\pi}/\sqrt18 ~ 0.7405. For many shapes, simple lattice packings easily surpass this packing fraction. For…
A simple application of classical density functional theory is derived and applied to a system of polymers grafted to a plane. The system is assumed to have symmetry in directions parallel to the grafting plane hence it being a…
We aim to present a generalized Bayesian inference method for constraining interiors of super Earths and sub-Neptunes. Our methodology succeeds in quantifying the degeneracy and correlation of structural parameters for high dimensional…
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 fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
A voxelization based post-processing algorithm is proposed to analyze the packing of non-spherical particle assemblies simulated using the Discrete Element Method. Voxelization of the particle data allows for isolating the geometric…
Dense packing in pick-and-place systems is an important feature in many warehouse and logistics applications. Prior work in this space has largely focused on planning algorithms in simulation, but real-world packing performance is often…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…