Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Publication
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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
Maryna Viazovska, Matthew De Courcy-Ireland, Maria Margarethe Dostert