Spring 2015

Information Theory in Combinatorics II

Wednesday, January 14th, 2015 3:00 pm4:00 pm

Add to Calendar

We will begin with a quick review of information theoretic notions such as entropy, conditional entropy, mutual information and information divergence. Based on these we will give information theoretic proofs of various classical results: Bregman's theorem, counting antichains, the Fredman-Komlos bound, Shearer's Lemma and its applications. Then, we will go on to see how information theoretic ideas can be used to establish various inequalities.

The first session of this talk will take place on Tuesday, January 13 from 3:00 pm – 4:00 pm.