Publication
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.
Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis
, ,
Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi