New upper bounds on sphere packings II
arXiv:math/0110010 · doi:10.2140/gt.2002.6.329
Abstract
We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and present some related results and conjectures.
Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol6/paper10.abs.html