Generating dense packings of hard spheres by soft interaction design

Abstract

Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize a lower bound on packing density. Our results suggest that exponentially many (in the number of particles) distinct disordered sphere packings can be effectively constructed by this method, up to a packing fraction close to $7d{2}^{-d}$. The latter is determined by solving the inverse problem of maximizing the dynamical glass transition over the space of the interaction potentials. Our method crucially exploits a recent exact formulation of the thermodynamics and the dynamics of simple liquids in infinite dimension.

arXiv comment28 pages, 5 figures, 2 tables. Submission to SciPost. Added clarifications and references

References in corpus (40)

• Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
• Mean field theory of hard sphere glasses and jamming
• Broken Replica Symmetry Bounds in the Mean Field Spin Glass Model
• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• Higher order glass-transition singularities in colloidal systems with attractive interactions
• Packing Hyperspheres in High-Dimensional Euclidean Spaces
• Reentrant glass transition in a colloid-polymer mixture with depletion attractions
• Pair Correlation Function Characteristics of Nearly Jammed Disordered and Ordered Hard-Sphere Packings
• Glass and Jamming Transitions: From Exact Results to Finite-Dimensional Descriptions
• The sphere packing problem in dimension 24
• The sphere packing problem in dimension 8
• Rigorous Inequalities between Length and Time Scales in Glassy Systems
• A first principle computation of the thermodynamics of glasses
• Statistical mechanics of the random K-SAT model
• Unreasonable Effectiveness of Learning Neural Networks: From Accessible States and Robust Ensembles to Basic Algorithmic Schemes
• Liquid-Liquid Phase Transitions for Soft-Core Attractive Potentials
• A variational description of the ground state structure in random satisfiability problems
• Solution of the dynamics of liquids in the large-dimensional limit
• Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems
• Glass transition and random close packing above three dimensions
• Low temperature properties of core-softened models: water vs. silica behavior
• Equilibrium Phase Behavior of a Continuous-Space Microphase Former
• Dimensional Study of the Caging Order Parameter at the Glass Transition
• Toy model for the mean-field theory of hard-sphere liquids
• Following the evolution of glassy states under external perturbations: the full replica symmetry breaking solution
• Improved sphere packing lower bounds from Hurwitz lattices
• Assembly of nothing: Equilibrium fluids with designed structured porosity
• A simple theory for the dynamics of mean-field-like models of glass-forming fluids
• Statics and dynamics of infinite-dimensional liquids and glasses: a parallel, compact derivation
• Ground states and formal duality relations in the Gaussian core model
• On the most compact regular lattice in large dimensions: A statistical mechanical approach
• A thermodynamic description of colloidal glasses
• Microphase Equilibrium and Assembly Dynamics
• Unveiling the complex glassy dynamics of square shoulder systems: simulations and theory
• Cooperative heterogeneous facilitation: multiple glassy states and glass-glass transition
• On the density of cyclotomic lattices constructed from codes
• The large deviations of the whitening process in random constraint satisfaction problems
• Counterintuitive ground states in soft-core models
• Disconnected glass-glass transitions and swallowtail bifurcations in microscopic spin models with facilitated dynamics
• Packing hard spheres with short-range attraction in infinite dimension: Phase structure and algorithmic implications

Cited by in corpus (7)

• Biased landscapes for random Constraint Satisfaction Problems
• Optimization of the dynamic transition in the continuous coloring problem
• Biased measures for random Constraint Satisfaction Problems: larger interaction range and asymptotic expansion
• Selective Bootstrap Percolation
• Postponing the dynamical transition density using competing interactions
• Biased thermodynamics can explain the behaviour of smart optimization algorithms that work above the dynamical threshold
• Interacting Copies of Random Constraint Satisfaction Problems