Semidefinite programming bounds for the average kissing number

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

The average kissing number of ${\mathbb{R}}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in ${\mathbb{R}}^n$. We provid…