Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Online/Virtual |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Graph Container Methods
I will introduce the two ideas central to the method of graph containers, pioneered by works of Kleitman--Winston and Sapozhenko. Graph containers are a kind of tool for contour arguments --- for "beating the union bound," so to speak --- finding use in probabilistic combinatorics and statistical physics. We will take as a guiding example Sapozhenko's asymptotic enumeration of the independent sets of the hypercube. Time permitting, I'll discuss some recent variations of the method and some open problems.
No Notes/Supplements Uploaded