On an SDP relaxation for kissing number

We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.

[1]  Frank Vallentin,et al.  High-Accuracy Semidefinite Programming Bounds for Kissing Numbers , 2009, Exp. Math..

[2]  B. L. Waerden,et al.  Das Problem der dreizehn Kugeln , 1952 .

[3]  Kurt M. Anstreicher.  The Thirteen Spheres: A New Proof , 2004, Discret. Comput. Geom..

[4]  Florian Pfender,et al.  Improved Delsarte bounds for spherical codes in small dimensions , 2005, J. Comb. Theory, Ser. A.

[5]  Michael L. Overton,et al.  Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..

[6]  I. Jolliffe.  Principal Component Analysis , 2002 .

[7]  Karl Sigmund,et al.  Kepler’s conjecture: How some of the greatest minds in history helped solve one of the oldest math problems in the world , 2004 .

[8]  M. Ziegler,et al.  Kissing numbers, sphere packings, and some unexpected proofs , 2004 .

[9]  O. Musin.  The kissing number in four dimensions , 2003, math/0309430.

[10]  Ian T. Jolliffe,et al.  Principal Component Analysis , 2002, International Encyclopedia of Statistical Science.

[11]  Oleg R. Musin,et al.  A survey on the kissing numbers , 2015 .

[12]  Leo Liberti,et al.  New formulations for the Kissing Number Problem , 2007, Discret. Appl. Math..

[13]  N. Biggs.  Algebraic Graph Theory: The multiplicative expansion , 1974 .

[14]  Leo Liberti,et al.  Mathematical Programming Bounds for Kissing Numbers , 2017 .

[15]  C. Bachoc,et al.  New upper bounds for kissing numbers from semidefinite programming , 2006, math/0608426.