High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
From MaRDI portal
Publication:3580625
DOI10.1080/10586458.2010.10129070zbMath1279.11070arXiv0902.1105OpenAlexW2951179629MaRDI QIDQ3580625
Hans D. Mittelmann, Frank Vallentin
Publication date: 13 August 2010
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.1105
Semidefinite programming (90C22) Theta series; Weil representation; theta correspondences (11F27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items (19)
On an SDP relaxation for kissing number ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ Contact graphs of ball packings ⋮ Rigidity of spherical codes ⋮ Delsarte method in the problem on kissing numbers in high-dimensional spaces ⋮ Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16 ⋮ Towards a proof of the 24-cell conjecture ⋮ Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry ⋮ Invariant Semidefinite Programs ⋮ The State-of-the-Art in Conic Optimization Software ⋮ Latest Developments in the SDPA Family for Solving Large-Scale SDPs ⋮ CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications ⋮ On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming ⋮ Detecting a botnet in a network ⋮ Upper bounds for packings of spheres of several radii ⋮ Kissing number in non-Euclidean spaces of constant sectional curvature ⋮ Kissing numbers for balls with varying radii ⋮ Dual linear programming bounds for sphere packing via modular forms ⋮ Exploiting symmetry in copositive programs via semidefinite hierarchies
Uses Software
This page was built for publication: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
