High accuracy semidefinite programming bounds for kissing numbers

K. Schütte, B.L. van der Waerden, Das Problem der dreizehn Kugeln

1953

Earlier work this paper cites.

V.I. Levenshtein, On bounds for packing in n n -dimensional Euclidean space

1979

Earlier work this paper cites.

A.M. Odlyzko, N.J.A. Sloane, New bounds on the number of unit spheres that can touch a unit sphere in n dimensions

1979

Earlier work this paper cites.

P. Boyvalenkov, Small improvements of the upper bounds of the kissing numbers in dimensions 19 19 , 21 21 and 23 23

1994

Earlier work this paper cites.

J.H. Conway, N.J.A. Sloane, Sphere packings, lattices and groups

1999

Earlier work this paper cites.

R. Scharlau, R. Schulze-Pillot, Extremal lattices

1999

Earlier work this paper cites.

N.D. Elkies, Lattices, linear codes, and invariants, Part I/II

2000

Cited alongside, same era.

H.D. Mittelmann, An independent benchmarking of SDP and SOCP solvers

2003

Cited alongside, same era.

F. Bowert, Gewichtszähler und Distanzzähler von Codes und Kugelpackungen

2004

Cited alongside, same era.

B. Casselman, The difficulties of kissing in three dimensions

2004

Cited alongside, same era.

F. Pfender, G.M. Ziegler, Kissing numbers, sphere packings and some unexpected proofs

2004

Cited alongside, same era.

H. Cohn, J.H. Conway, N.D. Elkies, A. Kumar, The D 4 D_{4} root system is not universally optimal

2007

Later among the works it cites.

F. Pfender, Improved Delsarte bounds for spherical codes in small dimensions

2007

Later among the works it cites.

C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming

2008

Later among the works it cites.

K. Fujisawa, M. Fukuda, K. Kobayashi, M. Kojima, K. Nakata, M. Nakata, M. Yamashita, SDPA (SemiDefinite Programming Algorithm) and SDPA-GMP user’s manual — version 7.1.1

2008

Later among the works it cites.

O.R. Musin, The kissing number in four dimensions

2008

Later among the works it cites.