New upper bounds for kissing numbers from semidefinite programming

Simple item page
dc.creatorBachoc, Christine
dc.creatorVallentin, Frank
dc.date2006-08-16
dc.date2007-10-03
dc.date.accessioned2026-07-07T09:31:23Z
dc.date.available2026-07-07T09:31:23Z
dc.descriptionRecently 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.
dc.description17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society
dc.identifierhttps://arxiv.org/abs/math/0608426
dc.identifierhttp://arxiv.org/abs/math/0608426
dc.identifierJ. Amer. Math. Soc. 21 (2008), 909-924
dc.identifierdoi:10.1090/S0894-0347-07-00589-9
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158439
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.subject52C17, 90C22
dc.titleNew upper bounds for kissing numbers from semidefinite programming
dc.typetext

Files

Collections

arXiv