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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.