Minimal-energy clusters of hard spheres
DOI10.1007/BF02570704zbMATH Open0834.90106DBLPjournals/dcg/SloaneHDC95OpenAlexW1974881574WikidataQ56457245 ScholiaQ56457245MaRDI QIDQ1900964FDOQ1900964
Authors: N. J. A. Sloane, R. H. Hardin, T. D. S. Duff, J. H. Conway 
Publication date: 29 November 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131400
Recommendations
- Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
- Cluster algorithm for hard spheres and related systems
- Approximate energy minimization for large Lennard-Jones clusters
- Structure of hard spheres and related systems
- On the cardinality of collisional clusters for hard spheres at low density
- Cluster Theory of Condensing Systems
- Cluster expansion for a dilute hard sphere gas dynamics
- Global optima of Lennard-Jones clusters
- Free energy of hard \(D\)-dimensional spheres
Quadratic programming (90C20) Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Penny-packings with minimal second moments
- Title not available (Why is that?)
- Unsolved problems in geometry
- Convex Polyhedra with Regular Faces
- The status of the Kepler conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Densest Packings of Congruent Circles in an Equilateral Triangle
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing
- A new bound on the local density of sphere packings
- A new approach to the construction of optimal designs
- ON THE SPHERE PACKING PROBLEM AND THE PROOF OF KEPLER'S CONJECTURE
- Some progress in the packing of equal circles in a square
- Penny-packing and two-dimensional codes
- New trellis codes based on lattices and cosets
- Isotropic effective energy simulated annealing searches for low energy molecular cluster states
- New spherical 4-designs
- Title not available (Why is that?)
- Expressing \((a^ 2+b^ 2+c^ 2+d^ 2)^ 3\) as a sum of 23 sixth powers
Cited In (20)
- Finite-energy infinite clusters without anchored expansion
- Deriving finite sphere packings
- Long time behavior of stochastic hard ball systems
- On sublattices of the hexagonal lattice
- Modelling of micro clusters
- Spheres and sausages, crystals and catastrophes -- and a joint packing theory
- Minimal interatomic distance in Morse clusters
- Towards uniform online spherical tessellations
- The art of unlocking
- Two-best solutions under distance constraints: The model and exemplary results for matroids
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Critical configurations of solid bodies and the Morse theory of min functions
- Global optimisation of the mean first passage time for narrow capture problems in elliptic domains
- Structure of spherical Yukawa clusters
- On the optimality of finite constellations from algebraic lattices
- Title not available (Why is that?)
- Defects and frustration in the packing of soft balls
- Packings of circular discs. How a probabilistic perspective can complete a geometric analysis
- The most-dense and least-dense packings of circles and spheres
- Polyhedra in physics, chemistry and geometry
Uses Software
This page was built for publication: Minimal-energy clusters of hard spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900964)
