New upper bounds for kissing numbers from semidefinite programming

@article{Bachoc2006NewUB,
  title={New upper bounds for kissing numbers from semidefinite programming},
  author={Christine Bachoc and Frank Vallentin},
  journal={Theoretical Computer Science},
  year={2006}
}
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 . 

Semidefinite programming bounds for spherical codes

This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite programming. With this method we improve the previous bounds for the kissing number in several

Bounds for codes by semidefinite programming

  • O. Musin
  • Mathematics, Computer Science
  • 2006
TLDR
It is shown that using as variables power sums of distances, the upper bound problem for codes in two-point homogeneous spaces can be considered as a finite semidefinite programming problem.

SEMIDEFINITE PROGRAMMING BOUNDS FOR KISSING NUMBERS

The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method

High-Accuracy Semidefinite Programming Bounds for Kissing Numbers

TLDR
High-accuracy calculations of upper bounds for the kissing number based on semidefinite programming are reported on, finding that there is no 16-dimensional periodic sphere packing with average theta series.

Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry

TLDR
This article exploits the symmetry present in the semidefinite programming bound to provide improved upper bounds for the kissing number for n = 9, …, 23.

Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry

TLDR
The symmetry present in the semidefinite programming bound of Bachoc and Vallentin (2008) is exploited to provide improved upper bounds for the kissing number for values of n = 9, \ldots, 23.

An extension the semidefinite programming bound for spherical codes

  • O. Musin
  • Computer Science, Mathematics
  • 2019
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result

Bounds for codes via semidefinite programming

  • O. Musin
  • Mathematics, Computer Science
    2009 Information Theory and Applications Workshop
  • 2009
TLDR
Two extensions of Delsarte's method via semidefinite programming are considered and an extension of Schoenberg's theorem for multivariate Gegenbauer polynomials has been proved.

Upper bounds for energies of spherical codes of given cardinality and separation

TLDR
A linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance is introduced using Hermite interpolation and polynomials are constructed.
...

References

SHOWING 1-10 OF 40 REFERENCES

Improved Delsarte bounds for spherical codes in small dimensions

New code upper bounds from the Terwilliger algebra and semidefinite programming

  • A. Schrijver
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2005
We give a new upper bound on the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra of the Hamming cube.

Semidefinite programming relaxations for semialgebraic problems

  • P. Parrilo
  • Mathematics, Computer Science
    Math. Program.
  • 2003
TLDR
It is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility and provide a constructive approach for finding bounded degree solutions to the Positivstellensatz.

Improved Delsarte bounds via extension of the function space

TLDR
By extending the space of functions to be used, one can in some cases/dimensions improve the bounds that are achievable by the Delsarte method on kissing numbers and spherical codes.

New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions

Sphere packings, I

  • T. Hales
  • Physics, Mathematics
    Discret. Comput. Geom.
  • 1997
TLDR
A program to prove the Kepler conjecture on sphere packings is described and it is shown that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture.

The kissing number in four dimensions

The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three

Kissing numbers, sphere packings, and some unexpected proofs

The ikissing number problemi asks for the maximal number of white spheres that can touch a black sphere of the same size in n-dimensional space. The answers in dimensions one, two and three are

Sphere Packings, Lattices and Groups

The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to