On the packing of fourteen congruent spheres in a cube
The classical problem of finding the configuration of \(n\) points in a unit cube of the 3-dimensional Euclidean space for which the minimum mutual distance is maximal was determined by Schaer, for \(n\leq 10\). In [Math. Mag. 44, 199--208 (1971; Zbl 0228.52004)], \textit{M. Goldberg} has given up to \(n=27\) configurations suspected to be the optimal arrangements. In this paper, the author proves that the maximum of the minimum distance of \(14\) points in the 3-dimensional unit cube is \(\frac{\sqrt 2}{2}\), and at the same time Goldberg's conjecture is proved for \(n=14\).
- scientific article; zbMATH DE number 739036
- Optimal arrangements in packing congruent balls in a spherical container
- scientific article; zbMATH DE number 2114100
- Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
- scientific article; zbMATH DE number 4054468
- A better packing of ten equal circles in a square
- Dense packings of equal spheres in a cube
- Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
- Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)
- scientific article; zbMATH DE number 432979 (Why is no real title available?)
- scientific article; zbMATH DE number 4216647 (Why is no real title available?)
- scientific article; zbMATH DE number 4042714 (Why is no real title available?)
- scientific article; zbMATH DE number 739036 (Why is no real title available?)
- scientific article; zbMATH DE number 1748533 (Why is no real title available?)
- scientific article; zbMATH DE number 2140321 (Why is no real title available?)
- Improving dense packings of equal disks in a square
- Kreispackung in Quadraten
- More optimal packings of equal circles in a square
- New results in the packing of equal circles in a square
- On a Geometric Extremum Problem
- On the Densest Packing of Equal Spheres in a Cube
- On the Densest Packing of Spheres in a Cube
- On the Packing of Ten Equal Circles in a Square
- Optimal packing of 28 equal circles in a unit square -- the first reliable solution
- Packing up to 50 equal circles in a square
- Patterns and structures in disk packings
- Research Problems in Discrete Geometry
- Some progress in the packing of equal circles in a square
- The Densest Packing of 9 Circles in a Square
- The Densest Packing of Five Spheres in a Cube
- The Densest Packing of Six Spheres in a Cube
- The Packing of Equal Circles in a Square
- Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
- On limits of dense packing of equal spheres in a cube
- A nonsmooth program for jamming hard spheres
- scientific article; zbMATH DE number 739036 (Why is no real title available?)
- scientific article; zbMATH DE number 2114100 (Why is no real title available?)
This page was built for publication: On the packing of fourteen congruent spheres in a cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027757)