|COMPUTER SCIENCE/DISCRETE MATH II|
|Topic:||Combinatorial Reasoning in Information Theory|
|Affiliation:||Tel Aviv University and Member, School of Mathematics|
|Date:||Tuesday, December 2|
|Time/Room:||10:30am - 12:30pm/S-101|
Combinatorial arguments have played a crucial role in the investigation of several surprising phenomena in Information Theory. After a brief discussion of some of these results I will describe a recent example, based on joint work with Hassidim, Lubetzky, Stav and Weinstein, in which properties of graph powers, colorings of Cayley graphs, and the chromatic numbers of Kneser graphs are applied in the study of a broadcasting problem with side information.