High-Accuracy Semidefinite Programming Bounds for Kissing Numbers

DOI10.1080/10586458.2010.10129070MaRDI QIDQ3580625zbMATH OpenOpenAlexFDO

Authors 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, https://projecteuclid.org/euclid.em/1276784788

zbMATH Keywords

semidefinite programmingkissing numberaverage theta seriesextremal modular form

Mathematics Subject Classification ID

Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Theta series; Weil representation; theta correspondences (11F27) Lattice packing and covering (number-theoretic aspects) (11H31)

Abstract: The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This paper is a report on high accuracy calculations of these upper bounds for n <= 24. The bound for n = 16 implies a conjecture of Conway and Sloane: There is no 16-dimensional periodic point set with average theta series 1 + 7680q^3 + 4320q^4 + 276480q^5 + 61440q^6 + ...

Recommendations

• New upper bounds for kissing numbers from semidefinite programming
• Semidefinite programming bounds for the average kissing number
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• On an SDP relaxation for kissing number
• The Kissing Number Problem: A New Result from Global Optimization
• scientific article; zbMATH DE number 702183
• A constructive bound on kissing numbers
• Improved lower bounds for kissing numbers in dimensions 25 through 31
• Constructive kissing numbers in high-dimensional spaces
• Delsarte method in the problem on kissing numbers in high-dimensional spaces

Cited in

(23)

• Towards a proof of the 24-cell conjecture
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• New upper bounds for spherical codes and packings
• Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16
• Exploiting symmetry in copositive programs via semidefinite hierarchies
• New upper bounds for kissing numbers from semidefinite programming
• Kissing number in non-Euclidean spaces of constant sectional curvature
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• Detecting a botnet in a network
• Semidefinite programming bounds for the average kissing number
• Contact graphs of ball packings
• On an SDP relaxation for kissing number
• Dual linear programming bounds for sphere packing via modular forms
• On the Turing model complexity of interior point methods for semidefinite programming
• Delsarte method in the problem on kissing numbers in high-dimensional spaces
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• Kissing numbers for balls with varying radii
• Upper bounds for packings of spheres of several radii
• The state-of-the-art in conic optimization software
• Rigidity of spherical codes
• CAMPARY: CUDA multiple precision arithmetic library and applications
• Upper bounds for energies of spherical codes of given cardinality and separation
• Invariant Semidefinite Programs

Describes a project that uses

Uses Software

• Benchmarks for Optimization Software
• SDPA

This page was built for publication: High-Accuracy Semidefinite Programming Bounds for Kissing Numbers

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