High-accuracy semidefinite programming bounds for kissing numbers

Hans Mittelmann, Frank Vallentin

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


The kissing number in n-dimensional Euclidean space is the maximal number of nonoverlapping unit spheres that 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 sphere packing with average theta series 1 + 7680q3 + 4320q4 + 276480q5 + 61440q6 + ・・・.

Original languageEnglish (US)
Pages (from-to)175-179
Number of pages5
JournalExperimental Mathematics
Issue number2
StatePublished - 2010


  • Average theta series
  • Extremal modular form
  • Kissing number
  • Semidefinite programming

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'High-accuracy semidefinite programming bounds for kissing numbers'. Together they form a unique fingerprint.

Cite this