On limits of dense packing of equal spheres in a cube

MaRDI QIDQ2256132zbMATH OpenFDO

Authors Milos Tatarevic

Publication date 19 February 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.07933, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p35

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cubepacking of \(n\) congruent spheres

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

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/2ceil$ 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 $nleqlceil{p}^3/2ceil-2$. We introduce an optimization method to reveal improvements of these packings, and present many new improvements for $nleq4629$.

Review text

Summary: 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\leqslant 4629\).

Recommendations

• Dense packings of equal spheres in a cube
• Producing dense packings of cubes
• scientific article; zbMATH DE number 1748532
• scientific article; zbMATH DE number 4054468
• The closest packing of equal circles on a sphere

Cites work

• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• A reliable area reduction technique for solving circle packing problems
• Dense packings of equal spheres in a cube
• Differential evolution methods based on local searches
• scientific article; zbMATH DE number 739036 (Why is no real title available?)
• Improving dense packings of equal disks in a square
• New approaches to circle packing in a square. With program codes.
• On the Densest Packing of Equal Spheres in a Cube
• On the Densest Packing of Spheres in a Cube
• On the packing of fourteen congruent spheres in a cube
• Solving the problem of packing equal and unequal circles in a circular container

Cited in

(10)

• Dense packings of equal spheres in a cube
• On the problem of packing spheres in a cube
• Online circle and sphere packing
• Producing dense packings of cubes
• A novel series of sphere packings with arbitrarily low density
• scientific article; zbMATH DE number 3849991 (Why is no real title available?)
• scientific article; zbMATH DE number 4054468 (Why is no real title available?)
• On the optimality of the FCC lattice for soft sphere packing
• Upper bounds for packings of spheres of several radii
• Dense binary sphere packings

This page was built for publication: On limits of dense packing of equal spheres in a cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256132)