Remote Access Journal of the American Mathematical Society
Green Open Access

Journal of the American Mathematical Society

ISSN 1088-6834(online) ISSN 0894-0347(print)



New upper bounds for kissing numbers from semidefinite programming

Authors: Christine Bachoc and Frank Vallentin
Journal: J. Amer. Math. Soc. 21 (2008), 909-924
MSC (2000): Primary 52C17, 90C22
Published electronically: November 29, 2007
MathSciNet review: 2393433
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases $n = 3, 4, 8, 24$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Journal of the American Mathematical Society with MSC (2000): 52C17, 90C22

Retrieve articles in all journals with MSC (2000): 52C17, 90C22

Additional Information

Christine Bachoc
Affiliation: Laboratoire A2X, Université Bordeaux I, 351, cours de la Libération, 33405 Talence, France

Frank Vallentin
Affiliation: Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands

Keywords: Spherical codes, kissing number, semidefinite programming, orthogonal polynomials
Received by editor(s): October 17, 2006
Published electronically: November 29, 2007
Additional Notes: The second author was supported by the Netherlands Organization for Scientific Research under grant NWO 639.032.203 and by the Deutsche Forschungsgemeinschaft (DFG) under grant SCHU 1503/4-1.
Article copyright: © Copyright 2007 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.