Upper bounds for packings of spheres of several radii

@article{deLaat2014UpperBF,
title={Upper bounds for packings of spheres of several radii},
author={David de Laat and Fernando M{\'a}rio de Oliveira Filho and Frank Vallentin},
journal={Forum of Mathematics, Sigma},
year={2014},
volume={2}
}
• Published 12 June 2012
• Mathematics
• Forum of Mathematics, Sigma
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…
Computing Upper Bounds for the Packing Density of Congruent Copies of a Convex Body
• Mathematics
• 2018
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $$\mathbb {R}^n$$; this theorem is a generalization of the
SPHERE PACKING BOUNDS VIA SPHERICAL CODES
• Mathematics
• 2014
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all suciently high dimensions is due to Kabatiansky and
Compact Packings of Space with Two Sizes of Spheres
It is shown that the compact packings of Euclidean three-dimensional space with two sizes of spheres are exactly those obtained by filling with spheres of size 2-1, and the octahedral holes of a close-packing of sphere of size 1.
Unit Sphere Packings
Unit sphere packings are the classical core of (discrete) geometry. We survey old as well new results giving an overview of the art of the matters. The emphases are on the following five topics: the
Upper Bounds for Non-Congruent Sphere Packings
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry
• Mathematics, Computer Science
Discret. Comput. Geom.
• 2017
New upper bounds for the maximal density of translative packings of superballs in three dimensions (unit balls for the $$l^p_3$$l3p-norm) and of Platonic and Archimedean solids having tetrahedral symmetry are determined.
Some properties of optimal functions for sphere packing in dimensions 8 and 24
• Mathematics
• 2016
We study some sequences of functions of one real variable and conjecture that they converge uniformly to functions with certain positivity and growth properties. Our conjectures imply a conjecture of
A semidefinite programming hierarchy for packing problems in discrete geometry
• Computer Science, Mathematics
Math. Program.
• 2015
This work introduces topological packing graphs as an abstraction for infinite graphs coming from packing problems in discrete geometry and shows that the hierarchy converges to the independence number.
Mathematical optimization for packing problems
• Mathematics
• 2014
During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some
Semidefinite programming bounds for the average kissing number.
• Mathematics
• 2020
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound