Diverse densest ternary sphere packings
نویسندگان
چکیده
Abstract The exploration of the densest structures multi-sized hard spheres under periodic boundary conditions is a fundamental problem in mathematics and wide variety sciences including materials science. We present our exhaustive computational ternary sphere packings (DTSPs) for 451 radius ratios 436 compositions on top previous study [Koshoji Ozaki, Phys. Rev. E 104, 024 101 (2021)]. unbiased by random structure searching method discovers diverse 22 putative DTSPs, thereby 60 DTSPs are identified total 38 discussed study. Some discovered well-ordered, example, medium (9-7-3) placed straight line with comprising unit cell, DTSP has Pm 3 ¯ m symmetry if structural distortion corrected. At considerable number ratios, highest packing fractions achieved phase separations consisting only FCC and/or binary (DBSPs) all compositions. trend becoming more evident as small getting larger, which suggests either actually or that dense have cells larger than those this On other hand, increase particle size gets small. diversity indicates many unknown may hide very narrow range ratio where smaller due to competition respect candidates. Finally, we discuss correspondence real crystals based space group. Our can be effectively used prototypes ternary, quaternary, quinary crystal structures.
منابع مشابه
Densest binary sphere packings.
The densest binary sphere packings in the α-x plane of small to large sphere radius ratio α and small sphere relative concentration x have historically been very difficult to determine. Previous research had led to the prediction that these packings were composed of a few known "alloy" phases including, for example, the AlB(2) (hexagonal ω), HgBr(2), and AuTe(2) structures, and to XY(n) structu...
متن کاملSome ternary and quaternary codes and associated sphere packings
Tables are presented of good ternary and quaternary codes and they are used in the construction of dense sphere packings. Results include 1) tables of the best ternary and quaternary constacyclic codes (including cyclic codes) up to block length 50, 2 ) a class of optimal [ n , 21 codes over GF(q), 3) the ( U + U + w I2u + U I U ) construction, a new ternary code construction technique that can...
متن کاملInstitute for Mathematical Physics Densest Lattice Packings of 3{polytopes Densest Lattice Packings of 3{polytopes
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an eecient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کاملEfficient linear programming algorithm to generate the densest lattice sphere packings.
Finding the densest sphere packing in d-dimensional Euclidean space R(d) is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding theory, discrete geometry, number theory, and biological systems. Numerically generating the densest sphere packings becomes very challenging in high dimensions due to ...
متن کاملPhase diagram and structural diversity of the densest binary sphere packings.
The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the α-x plane of sphere radius ratio α and relative concentration x are at the Kepler limit α=1, where packings are monodisperse. Utilizing an implementation of the Torquato-Jiao sphere-packing algorithm [S. Torquato and Y. Jiao, Phys. Rev. E 82, 061302 (2010)], we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics communications
سال: 2022
ISSN: ['2399-6528']
DOI: https://doi.org/10.1088/2399-6528/ac7d38