Six-dimensional sphere packing and linear programming
2022
Abstract
We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn-Triantafillou to the case of odd weight and non-trivial character.
Details
Title
Six-dimensional sphere packing and linear programming
Author(s)
de Courcy-Ireland, Matthew ; Dostert, Maria ; Viazovska, Maryna
Pagination
36
Date
2022
Publisher
arXiv
Note
Submitted on 16 Nov 2022 (v1), last revised 27 Jul 2023 (v4, arXiv:2211.09044v4)
Record Appears in
Working papers
Work produced at EPFL
Published
Work produced at EPFL
Published
Record creation date
2023-12-04