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.
No takes yet. Share an insight, caveat, or question.
Courcy-Ireland et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: