BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:The Local Cut Lemma - Anton Bernshteyn (Illinois)
DTSTART:20170216T150000Z
DTEND:20170216T160000Z
UID:TALK2361AT
URL:/talk/index/2361
DESCRIPTION:The entropy compression method is an algorithmic t
echnique that was invented by Moser and Tardos in
order to give an effective proof of the Lovasz Loc
al Lemma (the LLL for short). It turns out that av
oiding the LLL and applying the entropy compressio
n method directly can lead to improvements\, somet
imes significant\, in combinatorial bounds. The Lo
cal Cut Lemma (the LCL for short) is a generalizat
ion of the LLL that implies these new combinatoria
l results. It hides technical details of the metho
d and thus makes the arguments simpler and shorter
. Although the LCL was inspired by the entropy com
pression method\, it has a direct probabilistic pr
oof (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 prov
ides an explicit lower bound for that probability.
In this talk\, I will present the LCL and explain
how to use it.
LOCATION:LTC Watson
CONTACT:Dr Andrew Treglown
END:VEVENT
END:VCALENDAR