Related papers: Densest binary sphere packings
A self-consistent model is developed for the surface and bulk states of thin Y_{1-y}Ca_yBa_2Cu_3O_{7-\delta} (YCBCO) films. The dispersions of the chain and plane layers are modelled by tight-binding bands, and the electronic structure is…
We study the influence of particle size asymmetry on structural evolution of randomly jammed binary sphere mixtures with varying large-sphere/small-sphere composition. Simulations of jammed packings are used to assess the transition from…
Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high…
Packing of spheres is a problem with a long history dating back to Kepler's conjecture in 1611. The highest density is realized in face-centred-cubic (FCC) and hexagonal-close-packed (HCP) arrangements. These are only limiting examples of…
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 have discovered a new family of three-dimensional crystal sphere packings that are strictly jammed (i.e., mechanically stable) and yet possess an anomalously low density. This family constitutes an uncountably infinite number of crystal…
The complexity of composite spectra of close binary star system makes study of the spectra of their component stars extremely difficult. For this reason there exists very little information on the photospheric chemical composition of stars…
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
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…
The majority of star formation results in binaries or higher multiple systems, and planets in such systems are constrained to a limited range of orbital parameters in order to remain stable against perturbations from stellar companions.…
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,…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
We present the first study of disordered jammed hard-sphere packings in four-, five- and six-dimensional Euclidean spaces. Using a collision-driven packing generation algorithm, we obtain the first estimates for the packing fractions of the…
A rule due to Bravais of wide validity for crystals is that their surfaces correspond to the densest planes of atoms in the bulk of the material. Comparing a theoretical model of i-AlPdMn with experimental results, we find that this…
Systems of hard nonspherical particles exhibit a variety of stable phases with different degrees of translational and orientational order, including isotropic liquid, solid crystal, rotator and a variety of liquid crystal phases. In this…
In $n$-dimensional hyperbolic space $\mathbf{H}^n$ $(n\ge2)$ there are $3$-types of spheres (balls): the sphere, horosphere and hypersphere. If $n=2,3$ we know an universal upper bound of the ball packing densities, where each ball volume…
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…
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…
The graphene-graphite relationship in structural geometry is a basic principle to predict novel two-dimensional (2D) materials. Here, we demonstrate that this is not the case in binary metallic systems. We use the Bayesian optimization…