Departmental Colloquium
Benny Sudakov
UCLA
Induced Matchings, Arithmetic Progressions and Communication
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.
Friday November 2, 2012 at 3:00 PM in SEO 636