High-accuracy semidefinite programming bounds for kissing numbers

Hans Mittelmann; Frank Vallentin

doi:10.1080/10586458.2010.10129070

High-accuracy semidefinite programming bounds for kissing numbers

Hans Mittelmann, Frank Vallentin

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Abstract

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 + 7680q³ + 4320q⁴ + 276480q⁵ + 61440q⁶ + ・・・.

Original language	English (US)
Pages (from-to)	175-179
Number of pages	5
Journal	Experimental Mathematics
Volume	19
Issue number	2
DOIs	https://doi.org/10.1080/10586458.2010.10129070
State	Published - 2010

Keywords

Average theta series
Extremal modular form
Kissing number
Semidefinite programming

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1080/10586458.2010.10129070

Cite this

@article{c79b3bfc19eb4247a9f43030e32afc86,

title = "High-accuracy semidefinite programming bounds for kissing numbers",

abstract = "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 + ・・・.",

keywords = "Average theta series, Extremal modular form, Kissing number, Semidefinite programming",

author = "Hans Mittelmann and Frank Vallentin",

note = "Funding Information: The second author was partially supported by the Deutsche Forschungsgemeinschaft (DFG) under grant SCHU 1503/4.",

year = "2010",

doi = "10.1080/10586458.2010.10129070",

language = "English (US)",

volume = "19",

pages = "175--179",

journal = "Experimental Mathematics",

issn = "1058-6458",

publisher = "A K Peters",

number = "2",

}

TY - JOUR

T1 - High-accuracy semidefinite programming bounds for kissing numbers

AU - Mittelmann, Hans

AU - Vallentin, Frank

N1 - Funding Information: The second author was partially supported by the Deutsche Forschungsgemeinschaft (DFG) under grant SCHU 1503/4.

PY - 2010

Y1 - 2010

N2 - 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 + ・・・.

AB - 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 + ・・・.

KW - Average theta series

KW - Extremal modular form

KW - Kissing number

KW - Semidefinite programming

UR - http://www.scopus.com/inward/record.url?scp=77957804705&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957804705&partnerID=8YFLogxK

U2 - 10.1080/10586458.2010.10129070

DO - 10.1080/10586458.2010.10129070

M3 - Article

AN - SCOPUS:77957804705

SN - 1058-6458

VL - 19

SP - 175

EP - 179

JO - Experimental Mathematics

JF - Experimental Mathematics

IS - 2

ER -

High-accuracy semidefinite programming bounds for kissing numbers

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this