Abstract
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous best-known arrangements were usually derived from a ccp by omission of a certain number of spheres without changing the initial structure. In this paper, we show that better arrangements exist for all $n\leq\lceil p^{3}/2\rceil-2$. We introduce an optimization method to reveal improvements of these packings, and present many new improvements for $n\leq4629$.
Highlights
We consider the problem of finding the densest packings of congruent, non-overlapping, spheres in a cube
We provide a lower bound for these improvements
We show that the described procedure can be used as a good packing method when n is slightly smaller than g(p)
Summary
We consider the problem of finding the densest packings of congruent, non-overlapping, spheres in a cube. Optimality of dn was conjectured for an infinite family of packings where dp3 /2e spheres are arranged in a cubic close-packed (ccp) structure [3]. √ of spheres in these packings, with a maximum separation distance denoted by dp = 2/(p − 1). We examine arrangements when n is close, but less than g(p) For this family of packings dn = d0p is often assumed, to mean that the densest known arrangements are derived from ccp by omission of a certain number of spheres without changing the initial structure. We provide a lower bound for these improvements.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.