Minimal-energy clusters of hard spheres

@article{Sloane1995MinimalenergyCO,
  title={Minimal-energy clusters of hard spheres},
  author={N. J. A. Sloane and Ronald H. Hardin and Tom Duff and John H. Conway},
  journal={Discrete \& Computational Geometry},
  year={1995},
  volume={14},
  pages={237-259}
}
What is the tightest packing ofN equal nonoverlapping spheres, in the sense of having minimal energy, i.e., smallest second moment about the centroid? The putatively optimal arrangements are described forN≤32. A number of new and interesting polyhedra arise. 
View on Springer
link.springer.com
122 Citations
Highly Influential Citations
1
Background Citations
20
Methods Citations
13
Results Citations
1

122 Citations

A Discrete Isoperimetric Inequality and Its Application to Sphere Packings

We consider finite packings of equal spheres in Euclidean 3–space E3. The convex hull of the sphere centers is the packing polytope. In the first part of the paper we prove a tight inequality between…

On sublattices of the hexagonal lattice

Dense Packing and Symmetry in Small Clusters of Microspheres

The emulsion system presents a route to produce new colloidal structures and a means to study how different physical constraints affect symmetry in small parcels of matter.

Historical Overview of the Kepler Conjecture

  • T. Hales
  • Physics
    Discret. Comput. Geom.
  • 2006
AbstractThis paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than…

Surface areas of equifacetal polytopes inscribed in the unit sphere $\mathbb{S}^2$

. This article is concerned with the problem of placing seven or eight points on the unit sphere S 2 in R 3 so that the surface area of the convex hull of the points is maximized. In each case, the…

Global Optima of Lennard-Jones Clusters

This paper summarizes the current state of knowledge concerning putative global minima of the potential energy function for Lennard-Jones clusters, an intensely studied molecular conformation…

Deriving Finite Sphere Packings

The general method presented here may have applications to other related problems in mathematics, such as the Erdos repeated distance problem and Euclidean distance matrix completion problems.

Wulff-shape and Density Deviation

Recent results on sphere packings show a remarkable relation between dense finite sphere packings and concepts of crystallography, such as the Gibbs–Curie surface energy and the Wulff-shape for ideal…

Structural optimization of Lennard-Jones clusters by a genetic algorithm

k-Best Solutions under Distance Constraints in Valuated Δ-Matroids

In discrete maximization problems one usually wants to find an optimal solution. However, in several topics like “alignments,” “automatic speech recognition,” and “computer chess” people are…
...

References

SHOWING 1-10 OF 36 REFERENCES

Penny-packings with minimal second moments

Using the algorithm, it is proved that, except forn=212, then-point packings obtained by Graham and Sloane are optimal among hexagonal packings.

Some progress in the packing of equal circles in a square

A new bound on the local density of sphere packings

  • D. Muder
  • Computer Science
    Discret. Comput. Geom.
  • 1993
Borders are proved by cutting a Voronoi polyhedron into cones, one for each of its faces, and the sum of all the cone volume bounds is minimized when there are 13 faces each of solid angle 4π/13.

Penny-packing and two-dimensional codes

This work considers the problem of packingn equal circles (i.e., pennies) in the plane so as to minimize the second momentU about their centroid, and appears to produce optimal packings for infinitely many values ofn.

Physical cluster mechanics: Statics and energy surfaces for monatomic systems

Abstract The potential energy surfaces for clusters of some three to sixty atoms under Lennard-Jones forces have been systematically explored using numerical optimization techniques. In searching for…

Convex Polyhedra with Regular Faces

  • N. Johnson
  • Mathematics
    Canadian Journal of Mathematics
  • 1966
An interesting set of geometric figures is composed of the convex polyhedra in Euclidean 3-space whose faces are regular polygons (not necessarily all of the same kind). A polyhedron with regular…

Packing circles in a square: A review and new results

There are many interesting optimization problems associated with the packing and covering of objects in a closed volume or bounded surface Typical examples arise in classical physics or chemistry…

Theta series and magic numbers for close‐packed spherical clusters

In the face‐centered cubic lattice each sphere is surrounded by a shell of 12 spheres, then shells of 6 and 24, the whole configuration forming a spherical cluster of 43 spheres. This paper presents…

Morphology and statistical statics of simple microclusters

Abstract In this paper we discuss the statics of small assemblies of soft, rare-gas type atoms (N=4 to 13) interacting under simple two-body central forces such as the Lennard-Jones and Morse type.…

Statistical mechanics and morphology of very small atomic clusters

Mechanical and thermodynamic systems of a very few atoms (N≤ 100) interacting through central-forces are considered in the light of their role in an ideal model for “precipitation”. We discuss the…