Improved Delsarte bounds for spherical codes in small dimensions

Simple item page
dc.creatorPfender, Florian
dc.date2005-01-27
dc.date2008-03-10
dc.date.accessioned2026-07-07T09:25:43Z
dc.date.available2026-07-07T09:25:43Z
dc.descriptionWe present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can be viewed in our framework.
dc.description16 pages, 3 figures. Substantial changes after referee's comments, one new lemma
dc.identifierhttps://arxiv.org/abs/math/0501493
dc.identifierhttp://arxiv.org/abs/math/0501493
dc.identifierJ. Combin. Theory Ser. A 114 (2007) Issue 6, 1133-1147
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156497
dc.subjectCombinatorics
dc.subject05B40; 52C17
dc.titleImproved Delsarte bounds for spherical codes in small dimensions
dc.typetext

Files

Collections

arXiv