Optimality and uniqueness of the (4, 10, 1 / 6) spherical code

Journal of Combinatorial Theory. Series A

Volumn 116, Issue 1, 2009, Pages 195-204

  Bachoc, Christine ^a   Vallentin, Frank ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b CWI   (Netherlands)

Author keywords

Linear programming; Petersen graph; Semidefinite programming; Spherical codes; Spherical designs

Indexed keywords

EID: 55749105169     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2008.05.001     Document Type: Article

References (19)

1. Andrews G.E., Askey R., and Roy R. Special Functions (1999), Cambridge Univ. Press
2. Bachoc C., and Vallentin F. New upper bounds for kissing numbers from semidefinite programming. J. Amer. Math. Soc. 21 (2008) 909-924
3. C. Bachoc, F. Vallentin, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps, European J. Combin., preprint, arXiv:math/0610856v2 [math.MG], October 2007
4. Bannai E., and Ito T. Algebraic Combinatorics I: Association Schemes (1984), Benjamin/Cummings, Menlo Park, CA
5. Bannai E., and Sloane N.J.A. Uniqueness of certain spherical codes. Canad. J. Math. 33 (1981) 437-449
6. B. Ballinger, G. Blekherman, H. Cohn, N. Giansiracusa, E. Kelly, A. Schürmann, Experimental study of energy-minimizing point configurations on spheres, preprint, arXiv:math.MG/0611451v2 [math.MG], September 2007; Experiment. Math., in press
7. Borchers B. CSDP, A C Library for Semidefinite Programming. Optim. Methods Softw. 11 (1999) 613-623
8. Brouwer A.E., Cohen A.M., and Neumaier A. Distance-Regular Graphs (1989), Springer-Verlag
9. Croft H.T., Falconer K.J., and Guy R.K. Unsolved Problems in Geometry (1991), Springer-Verlag
10. Cameron P.J., Goethals J.M., and Seidel J.J. Strongly regular graphs having strongly regular subconstituents. J. Algebra 55 (1978) 257-280
11. Cohn H., and Kumar A. Universally optimal distributions of points on spheres. J. Amer. Math. Soc. 20 (2007) 99-148
12. Cohn H., and Kumar A. Uniqueness of the (22, 891, 1 / 4) spherical code. New York J. Math. 13 (2007) 147-157
13. Conway J.H., and Sloane N.J.A. Sphere Packings, Lattices and Groups (1988), Springer-Verlag
14. 7. Des. Codes Cryptogr. 34 (2005) 333-337
15. Delsarte P., Goethals J.M., and Seidel J.J. Spherical codes and designs. Geom. Dedicata 6 (1977) 363-388
16. Kabatiansky G.A., and Levenshtein V.I. Bounds for packings on a sphere and in space. Probl. Inf. Transm. 14 (1978) 1-17
17. Levenshtein V.I. Designs as maximum codes in polynomial metric spaces. Acta Appl. Math. 29 (1992) 1-82
18. de Loera J., Sturmfels B., and Thomas R.A. Gröbner bases and triangulations of the second hypersimplex. Combinatorica 15 (1995) 409-424
19. Schütte K., and van der Waerden B.L. Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand eins Platz?. Math. Ann. 123 (1951) 96-124