Upper bounds for packings of spheres of several radii
From MaRDI portal
Publication:5496785
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.
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
Cites work
- scientific article; zbMATH DE number 3916373 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 1284419 (Why is no real title available?)
- scientific article; zbMATH DE number 1054782 (Why is no real title available?)
- scientific article; zbMATH DE number 918597 (Why is no real title available?)
- scientific article; zbMATH DE number 3084450 (Why is no real title available?)
- A Survey of Condition Number Estimation for Triangular Matrices
- A proof of the Kepler conjecture
- Ausfüllung der Ebene durch Kreise
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Lower bounds for measurable chromatic numbers
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds on sphere packings. I
- On linear unequal error protection codes
- Optimality and uniqueness of the Leech lattice among lattices
- Packing circles of two different sizes on the sphere. II
- Packing of incongruent circles on the sphere
- Positive definite functions on spheres
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Random heterogeneous materials. Microstructure and macroscopic properties
- Real zeros for positive semidefinite forms. I
- Remarks on my paper: ``Packing of incongruent circles on the sphere
- Some densest two-size disc packings in the plane
- Spherical codes and designs
- Sums of squares, moment matrices and optimization over polynomials
- The Packing of Equal Spheres
- The ellipsoid method and its consequences in combinatorial optimization
- Universally optimal distribution of points on spheres
Cited in
(29)- A Note on Lattice Packings via Lattice Refinements
- Sphere packing bounds via spherical codes
- A recursive Lovász theta number for simplex-avoiding sets
- Towards a proof of the 24-cell conjecture
- A semidefinite programming hierarchy for packing problems in discrete geometry
- 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
- Semidefinite programming bounds for the average kissing number
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- 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
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming
- Dual linear programming bounds for sphere packing via modular forms
- On the Turing model complexity of interior point methods for semidefinite programming
- A copositive formulation for the stability number of infinite graphs
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- 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
- Computing upper bounds for the packing density of congruent copies of a convex body
- Exact Semidefinite Programming Bounds for Packing Problems
- scientific article; zbMATH DE number 7503192 (Why is no real title available?)
- Bounds for local density of sphere packings and the Kepler conjecture
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)
