New Upper Bounds on Sphere Packings I

dc.contributor.author	Cohn, Henry
dc.contributor.author	Elkies, Noam
dc.date.accessioned	2009-05-19T15:39:57Z
dc.date.issued	2003
dc.identifier.citation	Cohn, Henry and Noam D. Elkies. 2003. New upper bounds on sphere packings I. Annals of Mathematics 157, no. 2: 689-714.	en
dc.identifier.issn	0003-486X	en
dc.identifier.uri	http://nrs.harvard.edu/urn-3:HUL.InstRepos:2960190
dc.description.abstract	We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.	en
dc.description.sponsorship	Mathematics	en
dc.language.iso	en_US	en
dc.publisher	Princeton University	en
dc.relation.isversionof	http://dx.doi.org/10.4007/annals.2003.157.689	en
dc.relation.hasversion	http://arxiv.org/abs/math/0110009	en
dash.license	LAA
dc.title	New Upper Bounds on Sphere Packings I	en
dc.relation.journal	Annals of Mathematics	en
dash.depositing.author	Elkies, Noam
dc.identifier.doi	10.4007/annals.2003.157.689	*
dash.contributor.affiliated	Elkies, Noam