Six-dimensional sphere packing and linear programming
2024
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 [Math. Comp. 91 (2021), pp. 491-508] 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
Published in
Mathematics Of Computation
Date
2024-03-20
Publisher
Providence, Amer Mathematical Soc
ISSN
0025-5718
1088-6842
1088-6842
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
TN
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > MATH - Institute of Mathematics > TN - Chair of Number Theory
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Grant
Swiss National Science Foundation: 184927
Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation
Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation
Record creation date
2024-04-17