Semidefinite programming bounds for the average kissing number

Maria Dostert*, Alexander Kolpakov, Fernando Mário de Oliveira Filho

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

26 Downloads (Pure)


The average kissing number in ℝn is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in ℝn. We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions 3,.., 9. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions 6,.., 9 our new bound is the first to improve on this simple upper bound.

Original languageEnglish
Pages (from-to)635-659
Number of pages25
JournalIsrael Journal of Mathematics
Issue number2
Publication statusPublished - 2022

Bibliographical note

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.


Dive into the research topics of 'Semidefinite programming bounds for the average kissing number'. Together they form a unique fingerprint.

Cite this