Benny Sudakov: Induced matchings, arithmetic progressions and communication

Practicalities

The presentation starts at 11:15. After about an hour or slightly less, there will be a light lunch (register at this doodle by Tuesday April 1 at 8 pm). After lunch, those of us who wish reconvene for roughly one more hour of more technical discussions.

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.