New upper bounds for kissing numbers from semidefinite programming

Abstract

Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24.

17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society

Cited by in corpus (56)

• Distance-regular graphs
• Distributing many points on spheres: minimal energy and designs
• Symmetry in semidefinite programs
• Commutative association schemes
• Optimal simplices and codes in projective spaces
• High accuracy semidefinite programming bounds for kissing numbers
• The strong thirteen spheres problem
• Upper bounds for packings of spheres of several radii
• Invariant semidefinite programs
• A semidefinite programming hierarchy for packing problems in discrete geometry
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Optimality and uniqueness of the (4,10,1/6) spherical code
• Three-point bounds for energy minimization
• Semidefinite programming, harmonic analysis and coding theory
• Coding Theory and Algebraic Combinatorics
• Upper bounds for $s$-distance sets and equiangular lines
• Bounds for projective codes from semidefinite programming
• $k$-point semidefinite programming bounds for equiangular lines
• Complete positivity and distance-avoiding sets
• Lecture notes: Semidefinite programs and harmonic analysis
• "Magic" numbers in Smale's 7th problem
• Moment methods in energy minimization: New bounds for Riesz minimal energy problems
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• Contact graphs of ball packings
• More on spherical designs of harmonic index $t$
• New bounds for equiangular lines
• Moments of isotropic measures and optimal projective codes
• New bounds for equiangular lines and spherical two-distance sets
• Generalizations of Schoenberg's theorem on positive definite kernels
• Mathematical optimization for packing problems
• Positive semidefinite approximations to the cone of copositive kernels
• Potential theory with multivariate kernels
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• Orbital Geometry in Optimisation
• Kissing number in non-Euclidean spaces of constant sectional curvature
• Upper bounds for energies of spherical codes of given cardinality and separation
• Kissing number in hyperbolic space
• Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions
• A semidefinite programming hierarchy for covering problems in discrete geometry
• On Exact Reznick, Hilbert-Artin and Putinar's Representations
• Sphere packing bounds via rescaling
• Semidefinite Programming Bounds For Spherical Three-distance Sets
• On projective $q^r$-divisible codes
• An extension the semidefinite programming bound for spherical codes
• Semidefinite programming bounds for error-correcting codes
• Nonexistence of tight spherical design of harmonic index 4
• New bounds for spherical two-distance sets
• Delimiting Maximal Kissing Configurations in Four Dimensions
• Applications of semidefinite programming to coding theory
• Bounds for solid angles of lattices of rank three
• Kissing numbers and the centered maximal operator
• Noncommutative Spherical Codes
• Kissing number in spherical space
• Using real algebraic geometry to solve combinatorial problems with symmetries
• Mutually unbiased bases: polynomial optimization and symmetry
• Convex optimization