Skip to main content

All Questions

Filter by
Sorted by
Tagged with
11 votes
2 answers
964 views

Why is modular forms applicable to packing density bounds from linear programming at $n\in\{8,24\}$?

Sphere packing problem in $\mathbb R^n$ asks for the densest arrangement of non-overlapping spheres within $\mathbb R^n$. It is now know that the problem is solved at $n=8$ and $n=24$ using modular ...
VS.'s user avatar
  • 1,826