Dual linear programming bounds for sphere packing via discrete reductions

DOI10.1016/J.AIM.2024.110043MaRDI QIDQ6662442

Rupert Li

Publication date: 14 January 2025

Published in: Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear programmingsphere packingPoisson summationdual bounds

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New upper bounds on sphere packings. II
• New upper bounds on sphere packings. I
• Om nogle geometrisk taltheoretiske Theoremer.
• On positive quaternary quadratic forms
• An optimal uncertainty principle in twelve dimensions via modular forms
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• A proof of the Kepler conjecture
• High-dimensional sphere packing and the modular bootstrap
• Universally optimal distribution of points on spheres
• New upper bounds for kissing numbers from semidefinite programming
• Binary codes with a minimum distance of four (Corresp.)
• Dual linear programming bounds for sphere packing via modular forms
• A FORMAL PROOF OF THE KEPLER CONJECTURE
• Upper bounds for packings of spheres of several radii
• Sphere Packings and Error-Correcting Codes
• An Extreme Duodenary Form
• THE ARITHMETIC MINIMA OF POSITIVE QUADRATIC FORMS (I)
• On quadratic forms.
• Unique optima of the Delsarte linear program
• Six-dimensional sphere packing and linear programming
• New upper bounds for spherical codes and packings

This page was built for publication: Dual linear programming bounds for sphere packing via discrete reductions

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