Spherical codes, maximal local packing density, and the Golden ratio

DOI10.1063/1.3372627zbMATH Open1310.52023arXiv1003.3604OpenAlexW3106464822MaRDI QIDQ5249145FDOQ5249145

Authors: Adam B. Hopkins, Frank H. Stillinger, Salvatore Torquato 

Publication date: 29 April 2015

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Abstract: The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of the fixed sphere to the centers of any of the N surrounding spheres is minimized. Solutions to the DLP problem are relevant to the realizability of pair correlation functions for packings of nonoverlapping spheres and might prove useful in improving upon the best known upper bounds on the maximum packing fraction of sphere packings in dimensions greater than three. The optimal spherical code problem in Rd involves the placement of the centers of N nonoverlapping spheres of unit diameter onto the surface of a sphere of radius R such that R is minimized. It is proved that in any dimension, all solutions between unity and the golden ratio to the optimal spherical code problem for N spheres are also solutions to the corresponding DLP problem. It follows that for any packing of nonoverlapping spheres of unit diameter, a spherical region of radius less than or equal to the golden ratio centered on an arbitrary sphere center cannot enclose a number of sphere centers greater than one more than the number that can be placed on the region's surface.

Full work available at URL: https://arxiv.org/abs/1003.3604

Recommendations

• scientific article; zbMATH DE number 1759151
• New packings on a finite-dimensional Euclidean sphere
• Locally optimal 2-periodic sphere packings
• Densest packings of more than three \(d\)-spheres are nonplanar
• scientific article; zbMATH DE number 1274377

Mathematics Subject Classification ID

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

Cites Work

• A note on optimal unimodular lattices
• Packing of spheres in spaces of constant curvature
• Realizability of point processes
• New upper bounds on sphere packings. I
• Title not available (Why is that?)
• The Closest Packing of Spherical Caps in n Dimensions
• The kissing number in four dimensions
• Optimality and uniqueness of the Leech lattice among lattices
• Codes on Euclidean spheres
• Densest packings of eleven congruent circles in a circle
• New Conjectural Lower Bounds on the Optimal Density of Sphere Packings
• Uniqueness of the 120-point spherical 11-design in four dimensions

Cited In (4)

• Sphere packing bounds via spherical codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite Blaschke products and the golden ratio

This page was built for publication: Spherical codes, maximal local packing density, and the Golden ratio

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