Six-dimensional sphere packing and linear programming

DOI10.1090/MCOM/3959MaRDI QIDQ6129013zbMATH OpenOpenAlexFDO

Authors Matthew De Courcy-Ireland, M. Dostert, Maryna Viazovska

Publication date 16 April 2024

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2211.09044

Mathematics Subject Classification ID

Linear programming (90C05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Fourier coefficients of automorphic forms (11F30)

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.

Recommendations

• Dual linear programming bounds for sphere packing via modular forms
• New upper bounds on sphere packings. I
• Sphere packing bounds via spherical codes
• The sphere packing problem in dimension \(24\)
• New upper bounds on sphere packings. II

Cited in

(1)

• Dual linear programming bounds for sphere packing via discrete reductions

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Six-dimensional sphere packing and linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129013)