New Bounds for Spherical Two-Distance Sets

References

• Bachoc , [Bachoc 09] C. 2009 . Semidefinite Programming, Harmonic Analysis and Coding Theory . arXiv:0909.4767
   Google Scholar
• Bachoc , [Bachoc and Vallentin 08] C. and Vallentin , F. 2008 . New Upper Bounds for Kissing Numbers from Semidefinite Programming . J. Amer. Math. Soc. , 21 : 909 – 924 .
   Web of Science ®Google Scholar
• Bachoc , [Bachoc et al. 12] C. , Gijswijt , D. C. , Schrijver , A. and Vallentin , F. 2012 . “ Invariant Semidefinite Programs ” . In Handbook on Semidefinite, Conic and Polynomial Optimization , 219 – 269 . Springer . Internat. Ser. Oper. Res. Management Sci. 166
   Google Scholar
• Bannai , [Bannai et al. 04] E. , Munemasa , A. and Venkov , B. 2005 . The Nonexistence of Certain Tight Spherical Designs . St. Petersburg Math. J. , 16 : 609 – 625 .
   Google Scholar
• Ben-Tal , [Ben-Tal and Nemirovski 01] A. and Nemirovski , A. 2001 . Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications , SIAM .
   Google Scholar
• Delsarte , [Delsarte 73] P. 1973 . An Algebraic Approach to the Association Schemes of Coding Theory . Philips Research Repts Suppl. , 10 : 1 – 97 .
   Google Scholar
• Delsarte , [Delsarte et al. 77] P. , Goethals , J. M. and Seidel , J. J. 1977 . Spherical Codes and Designs . Geometriae Dedicata , 6 : 363 – 388 .
   Google Scholar
• Dunkl , [Dunkl 76] C. 1976 . A Krawtchouk Polynomial Addition Theorem and Wreath Products of Symmetric Groups . Indiana Univ. Math. J. , 25 : 335 – 358 .
   Web of Science ®Google Scholar
• Kabatyansky , [Kabatyansky and Levenshtein 78] G. A. and Levenshtein , V. I. 1978 . Bounds for Packings on the Sphere and in the Space . Problems of Information Transmission , 14 : 3 – 25 .
   Google Scholar
• Larman , [Larman et al. 77] D. G. , Rogers , C. A. and Seidel , J. J. 1977 . On Two-Distance Sets in Euclidean Space . Bull. London Math. Soc. , 9 : 261 – 267 .
   Google Scholar
• Lemmens , [Lemmens and Seidel 73 P. W. H. and Seidel , J. J. 1973 . Equiangular Lines . Journal of Algebra , 24 : 494 – 512 .
   Web of Science ®Google Scholar
• Martin , [Martin and Tanaka 09] W. J. and Tanaka , H. 2009 . Commutative Association Schemes . European J. Combin. , 30 : 1497 – 1525 .
   Google Scholar
• Mittelman , [Mittelman and Vallentin 10] H. D. and Vallentin , F. 2010 . High Accuracy Semidefinite Programming Bounds for Kissing Numbers . Experimental Mathematics , 19 : 174 – 178 .
   Google Scholar
• Musin , [Musin 09] O. R. 2009 . Spherical Two-Distance Sets . J. Combin. Theory Ser. A , 116 : 988 – 995 .
   Google Scholar
• Nebe , [Nebe and Venkov 12] G. and Venkov , B. 2012 . On Tight Spherical Designs . arXiv:1201.1830
   Google Scholar
• Nesterov , [Nesterov 00] Yu . 2000 . “ Squared Functional Systems and Optimization Problems ” . In High Performance Optimization , Edited by: Frenk , H. , Roos , K. , Terlaky , T. and Zhanget , S. 405 – 440 . Kluwer .
   Google Scholar
• Rankin , [Rankin 55] R. A. 1955 . The Closest Packing of Spherical Caps in n Dimensions . Proc. Glasgow Math. Assoc. , 2 : 139 – 144 .
   Google Scholar
• Schoenberg , [Schoenberg 42] I. J. 1942 . Positive Definite Functions on Spheres . Duke Math. J. , 9 : 96 – 107 .
   Google Scholar
• Schrijver , [Schrijver 05] A. 2005 . New Code Upper Bounds from the Terwilliger Algebra and Semidefinite Programming . IEEE Trans. Inform. Theory , 51 : 2859 – 2866 .
   Web of Science ®Google Scholar
• Vallentin , [Vallentin 09] F. 2009 . Symmetry in Semidefinite Programs . Linear Algebra Appl. , 430 : 360 – 369 .
   Google Scholar