“Induced Matchings, Arithmetic Progressions and Communication”

Dr. Benny Sudakov, UCLA

Wednesday, February 6, 2013
  3:40–5 p.m.

Tea time @ 3:40 p.m.

Talk Begins @ 4:10 p.m.

Ends 5:00 p.m.

Abstract:

Extremal Combinatorics is one of the central branches of discrete mathematics which deals with the problem of estimating the maximum possible size of a combinatorial structure which satisfies certain restrictions. Often, such problems have also applications to other areas including Theoretical Computer Science, Additive Number Theory and Information Theory. In this talk we will illustrate this fact by several closely related examples focusing on a recent work with Alon and Moitra.