  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.
