New Sphere-Packing Record Stems from an Unexpected Source

10 months ago

The sphere-packing problem involves arranging balls in a box as efficiently as possible, with applications in cryptography and communication.
Johannes Kepler conjectured the optimal 3D sphere packing in the 17th century, but it took 400 years to prove.
Mathematicians still don't know the optimal packing in higher dimensions, except for dimensions 8 and 24.
Boaz Klartag recently set a new sphere-packing record using an old technique abandoned decades earlier.
Klartag's method uses convex geometry to improve ellipsoid-based packing, achieving significant efficiency gains in high dimensions.
His work revives debates on whether optimal packings should be ordered (lattice-based) or disordered.
Klartag's result suggests symmetry and order might be key to optimal high-dimensional packings.
The breakthrough has potential implications for cryptography and communications, sparking excitement among researchers.
Klartag aims to reconnect convex geometry and lattice theory, fields that have grown apart over time.

Hasty Briefsbeta