Title: Applications of the entropy method
|University of Waterloo
Abstract: In the second talk of our reading group on entropy and counting. Following Galvin's survey, we will focus on Friedgut and Kahn's determination of the maximum number of copies of a fixed graph that can appear in another graph on a fixed number of edges. If time permits, we also will examine Radhakrishnan's proof of Bregman's theorem on the maximum permanent of a 0-1 matrix with fixed row sums.