Optimal Random Packing of Spheres and Extremal Effective Conductivity

2021

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.3390/sym13061063
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.