COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Packing Spheres RandomlyAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Perla Sousi. In this talk I’ll show that there exists a packing of identical spheres in \Rd of density $(1+o(1))2{-d-1}d*log d$ as $d\to \infty$. The proof uses a simple random algorithm where we sprinkle the spheres in rounds. This is joint work with Matthew Jenssen, Marcus Michelen and Julian Sahasrabudhe. This talk is part of the Probability series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsOpen Cambridge talks Cambridge Judge Business School Type the title of a new list hereOther talksWorkshop: Afghanistan: A Neglected Reality The role of reward in language learning Comets in medieval Arabic astronomical and historical treatise Lunch EMG reading group on Gopakuma-Vafa invariants. 2024 Kendrew Lecture: TBC |