Optimization Online


Upper bounds for packings of spheres of several radii

David de Laat(mail***at***daviddelaat.nl)
Fernando de Oliveira Filho(fmario***at***mi.fu-berlin.de)
Frank Vallentin(f.vallentin***at***tudelft.nl)

Abstract: We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for packings of spherical caps of two different sizes and for binary sphere packings. We also slightly improve bounds for the classical problem of packing identical spheres.

Keywords: sphere packing, spherical codes, polydisperse spheres, unequal error- protection, theta number, polynomial optimization, semidefinite programming

Category 1: Linear, Cone and Semidefinite Programming

Citation: arXiv:1206.2608v1 [math.MG]

Download: [PDF]

Entry Submitted: 06/13/2012
Entry Accepted: 06/13/2012
Entry Last Modified: 06/13/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society