加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本