High accuracy semidefinite programming bounds for kissing numbers
arXiv:0902.1105 · doi:10.1080/10586458.2010.10129070
Abstract
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 to find upper bounds for the kissing number based on semidefinite programming. This paper is a report on high accuracy calculations of these upper bounds for n <= 24. The bound for n = 16 implies a conjecture of Conway and Sloane: There is no 16-dimensional periodic point set with average theta series 1 + 7680q^3 + 4320q^4 + 276480q^5 + 61440q^6 + ...
7 pages (v3) new numerical result in Section 4, to appear in Experiment. Math
References in corpus (2)
Cited by in corpus (19)
- Upper bounds for packings of spheres of several radii
- On the Turing model complexity of interior point methods for semidefinite programming
- Invariant semidefinite programs
- Rigidity of spherical codes
- Semidefinite programming, harmonic analysis and coding theory
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Contact graphs of ball packings
- The Gregory-Newton Problem for Kissing Sticky Spheres
- Positive semidefinite approximations to the cone of copositive kernels
- Generalizations of Schoenberg's theorem on positive definite kernels
- Differentially Private Analysis of Outliers
- Working towards an optimal sampling of the 21 cm signal parameter space
- Kissing number in hyperbolic space
- Kissing number in non-Euclidean spaces of constant sectional curvature
- An extension the semidefinite programming bound for spherical codes
- Delimiting Maximal Kissing Configurations in Four Dimensions
- Noncommutative Spherical Codes
- Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16
- Using real algebraic geometry to solve combinatorial problems with symmetries