University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The Local Cut Lemma

The Local Cut Lemma

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

  • UserAnton Bernshteyn (Illinois)
  • ClockThursday 16 February 2017, 15:00-16:00
  • HouseLTC Watson.

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

The entropy compression method is an algorithmic technique that was invented by Moser and Tardos in order to give an effective proof of the Lovasz Local Lemma (the LLL for short). It turns out that avoiding the LLL and applying the entropy compression method directly can lead to improvements, sometimes significant, in combinatorial bounds. The Local Cut Lemma (the LCL for short) is a generalization of the LLL that implies these new combinatorial results. It hides technical details of the method and thus makes the arguments simpler and shorter. Although the LCL was inspired by the entropy compression method, it has a direct probabilistic proof (similar to the classical proof of the LLL ); in particular, not only does the LCL show that a certain probability is positive, but it also provides an explicit lower bound for that probability. In this talk, I will present the LCL and explain how to use it.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.