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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Packing Spheres Randomly

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Number theory study group: Iwasawa theory Gordon Lab Seminar Room, Austin Building, Dept. of Materials Science & Metallurgy Helmore (HEL113), Anglia Ruskin University, Cambridge

Other talks

Studying viruses to understand what makes pandemic viruses special and how innate immunity works Rethinking Egyptian Writing in the Bronze Age Levant: Towards a Model of Adaptive Innovation for the Umm el-Marra Cylinders and Anra Scarabs The Play Paradox: How video games build better humans Title abstract tbc External Seminar - Hilde Nelissen TBC Title to be confirmed
 

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