A simplicial (d-1)-dimensional complex K is called 'balanced' if the graph of K is d-colorable. Rather surprisingly, it turns out that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we will discuss the balanced analog of the celebrated Lower Bound Theorem (together with the...
Creator:
Novik, Isabella (University of Washington)
Created:
2014-11-13
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
This talk will be about a novel technique called 'spatial coupling' originally invented for constructing better error correcting codes. One can use spatial coupling as a mathematical tool to derive properties of 'standard' graphical models via an analysis of a 'coupled version'. A general methodology for obtaining provable better (sometimes opti...
Creator:
Macris, Nicolas (École Polytechnique Fédérale de Lausanne (EPFL))
Created:
2015-05-19
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.