Marcelo Campos "New Lower Bounds for Sphere Packing"
Marcelo Campos from Cambridge University will give the talk "New Lower Bounds for Sphere Packing" on the labs' Big Seminar.
Join in zoom
Meeting ID: 878-0002-3142 zoom-link
Password: not needed
Password: not needed
Abstract:
In this talk I'll show the existence of a packing of identical spheres in $R^d$ with density $(1-o(1))·{d·log(d) }/{2^{d+1}}$, as $d$ tends to infinity. This improves the best known asymptotic lower bounds for sphere packing density. The proof uses a connection with graph theory and a new result about independent sets in graphs which is proved probabilistically.
This is joint work with Matthew Jenssen, Marcus Michelen and Julian Sahasrabudhe.
Watch the video:
The language of the lecture is English. The event is aimed at master and graduate students, as well as researchers in the field of combinatorics.