University of Cambridge > Talks.cam > Probability > Packing Spheres Randomly

Packing Spheres Randomly

Add to your list(s) Download to your calendar using vCal

  • UserMarcelo Campos (DPMMS)
  • ClockTuesday 30 April 2024, 14:00-15:00
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity