English
Related papers

Related papers: How dense can one pack spheres of arbitrary size d…

200 papers

We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the…

Materials Science · Physics 2009-10-30 Tomaso Aste

Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…

Soft Condensed Matter · Physics 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

The Apollonian packings (APs) are fractals that result from a space-filling procedure with spheres. We discuss the finite size effects for finite intervals $s\in[s_\mathrm{min},s_\mathrm{max}]$ between the largest and the smallest sizes of…

Statistical Mechanics · Physics 2011-11-23 Francesco Varrato , Giuseppe Foffi

The aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…

Disordered Systems and Neural Networks · Physics 2009-11-11 F. Zamponi

If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…

Soft Condensed Matter · Physics 2014-03-18 Marc Z. Miskin , Heinrich M. Jaeger

Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis,…

Soft Condensed Matter · Physics 2013-08-06 Adrian Baule , Romain Mari , Lin Bo , Louis Portal , Hernan A. Makse

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…

Soft Condensed Matter · Physics 2014-09-15 Ping Wang , Chaoming Song , Yuliang Jin , Hernan A. Makse

The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…

Statistical Mechanics · Physics 2013-05-29 Adam B. Hopkins , Frank H. Stillinger , Salvatore Torquato

The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…

Soft Condensed Matter · Physics 2016-02-24 Lin Fu , William Steinhardt , Hao Zhao , Joshua E. S. Socolar , Patrick Charbonneau

High strength-to-weight ratio materials can be constructed by either maximizing strength or minimizing weight. Tensegrity structures and aerogels take very different paths to achieving high strength-to-weight ratios but both rely on…

Soft Condensed Matter · Physics 2021-09-06 R. C. Dennis , E. I. Corwin

A new formalism is presented for analytically obtaining the probability density function, \( P_{n}(s) \), for the distance between two random points in an \( n \)-dimensional sphere of radius \( R \). Our formalism allows \( P_{n}(s) \) to…

Mathematical Physics · Physics 2007-05-23 Shu-Ju Tu , Ephraim Fischbach

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…

Statistical Mechanics · Physics 2013-06-28 Yoav Kallus

Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered using spheres of a fixed radius. An…

Probability · Mathematics 2007-07-16 Ioannis Kontoyiannis

The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…

Disordered Systems and Neural Networks · Physics 2022-02-15 Raphael Blumenfeld

We develop a simple analytical theory that relates dense sphere packings in a cylinder to corresponding disk packings on its surface. It applies for ratios R=D/d (where d and D are the diameters of the hard spheres and the bounding…

Soft Condensed Matter · Physics 2015-05-20 Adil Mughal , Ho Kei Chan , Denis Weaire

We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $\Theta(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that…

Probability · Mathematics 2019-12-04 Matthew Jenssen , Felix Joos , Will Perkins

We propose a new type of effective densities via the potential distribution theorem. These densities are for the sake of enabling the mapping of the free energy of a uniform fluid onto that of a nonuniform fluid. The potential distribution…

Soft Condensed Matter · Physics 2012-02-21 L. L. Lee , G. Pellicane

We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…

Metric Geometry · Mathematics 2008-12-10 Gilbert Muraz , Jean-Louis Verger-Gaugry

We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…

Methodology · Statistics 2016-08-15 Xu He

Saturated random packing of particles built of two identical, relatively shifted spheres in two and three dimensional flat and homogeneous space was studied numerically using random sequential adsorption algorithm. The shift between centers…

Materials Science · Physics 2015-06-19 Michał Cieśla