University of Cambridge > Talks.cam > Combinatorics Seminar > Birthday Inequalities, Hard Spheres, and Independent Sets

Birthday Inequalities, Hard Spheres, and Independent Sets

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

  • UserWill Perkins (University of Birmingham)
  • ClockThursday 30 April 2015, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

I will discuss two related models from statistical physics: the hard sphere model of random non-overlapping spheres in Euclidean space, and the hard core model of a random independent set in the d-dimensional integer lattice. I will present a new method for bounding the partition function in both models, and as applications show bounds on the number of independent sets of a given size in d-regular graphs and show a surprising fact about spheres in 24 dimensions.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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