Skip to main content

Maria Dostert: A Semidefinite Programming Bound for the Average Kissing Number

Time: Wed 2021-02-24 10.15 - 11.15

Location: Zoom meeting ID: 654 5562 3260

Abstract: Any packing of finitely many balls in \(\mathbb{R}^n\) has a contact graph, in which the vertices are the balls and two vertices are adjacent if the balls touch. 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\). I will describe a semidefinite programming approach which provides the best upper bounds for the average kissing number in dimensions 3, ..., 9. (Joint work with Alexander Kolpakov and Fernando Mário de Oliveira Filho.)

Zoom link: https://kth-se.zoom.us/j/65455623260


Zoom meeting ID: 654 5562 3260

Page responsible:webmaster@math.kth.se
Belongs to: Department of Mathematics
Last changed: Feb 22, 2021