Upper bounds for packings of spheres of several radii
From MaRDI portal
Publication:5496785
DOI10.1017/FMS.2014.24zbMATH Open1310.52022arXiv1206.2608OpenAlexW2115967956WikidataQ56267765 ScholiaQ56267765MaRDI QIDQ5496785FDOQ5496785
Authors: David de Laat, Fernando Mário de Oliveira Filho, Frank Vallentin 
Publication date: 28 January 2015
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1206.2608
Recommendations
- New upper bounds on sphere packings. I
- New upper bounds on sphere packings. II
- Finite sphere packings and critical radii
- scientific article; zbMATH DE number 65118
- Sphere packings. IV: Detailed bounds
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere
- New Conjectural Lower Bounds on the Optimal Density of Sphere Packings
- Generalized Sphere Packing Bound
- On limits of dense packing of equal spheres in a cube
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cites Work
- A proof of the Kepler conjecture
- Title not available (Why is that?)
- Random heterogeneous materials. Microstructure and macroscopic properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- The ellipsoid method and its consequences in combinatorial optimization
- Positive definite functions on spheres
- Universally optimal distribution of points on spheres
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Real zeros for positive semidefinite forms. I
- Spherical codes and designs
- New upper bounds on sphere packings. I
- Lower bounds for measurable chromatic numbers
- New upper bounds for kissing numbers from semidefinite programming
- The Packing of Equal Spheres
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Optimality and uniqueness of the Leech lattice among lattices
- A Survey of Condition Number Estimation for Triangular Matrices
- Title not available (Why is that?)
- Some densest two-size disc packings in the plane
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- On linear unequal error protection codes
- Ausfüllung der Ebene durch Kreise
- Remarks on my paper: ``Packing of incongruent circles on the sphere
- Packing of incongruent circles on the sphere
- Title not available (Why is that?)
- Packing circles of two different sizes on the sphere. II
Cited In (29)
- Sphere packing bounds via spherical codes
- A recursive Lovász theta number for simplex-avoiding sets
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Towards a proof of the 24-cell conjecture
- New upper bounds for spherical codes and packings
- Upper bounds on packing density for circular cylinders with high aspect ratio
- Compact packings of space with two sizes of spheres
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Semidefinite programming bounds for the average kissing number
- High-dimensional sphere packing and the modular bootstrap
- On the problem of packing spheres in a cube
- The isostatic conjecture
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- Dual linear programming bounds for sphere packing via modular forms
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming
- On the Turing model complexity of interior point methods for semidefinite programming
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- A copositive formulation for the stability number of infinite graphs
- New upper bounds on sphere packings. I
- Density bounds for outer parallel domains of unit ball packings
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere
- Dual linear programming bounds for sphere packing via discrete reductions
- A universal upper bound on density of tube packings in hyperbolic space
- Exact Semidefinite Programming Bounds for Packing Problems
- Computing upper bounds for the packing density of congruent copies of a convex body
- Title not available (Why is that?)
- Bounds for local density of sphere packings and the Kepler conjecture
- A Note on Lattice Packings via Lattice Refinements
Uses Software
This page was built for publication: Upper bounds for packings of spheres of several radii
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496785)
