HackerPapers

arXiv:1603.06518math.NT

The sphere packing problem in dimension 24

Henry Cohn, Abhinav Kumar, Stephen D. Miller, Danylo Radchenko, Maryna Viazovska

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particular, we find an optimal auxiliary function for the linear programming bounds, which is an analogue of Viazovska's function for the eight-dimensional case.

arXiv comments
17 pages. The auxiliary file appendix.txt has been updated since publication in several ways that still follow the general strategy of the appendix but correct some details. Comments in the file explain the changes, and the original file is preserved as appendix-original.txt for comparison
Journal reference
Annals of Mathematics 185 (2017), 1017-1033
DOI
doi:10.4007/annals.2017.185.3.8
Subjects
math.NTNumber Theory math.MGMetric Geometry

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2020 to May 2020.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Circle Packing 1 comment
    • Sphere packings are quite a deep and fascinating area of pure mathemaics. It has close relations to coding theory, lattice theory, number theory, modular forms. John Conway [1] (who recently passed away due to COVID) wrote a famous book about it: Sphere Packings, Lattices and…

      heinrichhartmanView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.