Dual linear programming bounds for sphere packing via discrete reductions
From MaRDI portal
Cites work
- A formal proof of the Kepler conjecture
- A proof of the Kepler conjecture
- An Extreme Duodenary Form
- An optimal uncertainty principle in twelve dimensions via modular forms
- Binary codes with a minimum distance of four (Corresp.)
- Dual linear programming bounds for sphere packing via modular forms
- High-dimensional sphere packing and the modular bootstrap
- scientific article; zbMATH DE number 3483022 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Multivariate positive definite functions on spheres
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for spherical codes and packings
- New upper bounds on sphere packings. I
- New upper bounds on sphere packings. II
- Om nogle geometrisk taltheoretiske Theoremer.
- On positive quaternary quadratic forms
- On quadratic forms.
- Six-dimensional sphere packing and linear programming
- Sphere Packings and Error-Correcting Codes
- THE ARITHMETIC MINIMA OF POSITIVE QUADRATIC FORMS (I)
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Unique optima of the Delsarte linear program
- Universally optimal distribution of points on spheres
- Upper bounds for packings of spheres of several radii
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)