Inverse Results for Isoperimetric Inequalities - Part I
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore the inverse isoperimetric problem in graph theory through this comprehensive lecture. Delve into the structure of vertex subsets with minimal edge connections to their complements. Examine the Fourier-Entropy-Influence conjecture, its applications in PAC learning, and its relevance to the Hamming cube's inverse isoperimetric problem. Gain insights into recent advancements towards proving the conjecture and related inverse isoperimetric inequalities. Learn about collaborative research findings from Lifshitz and colleagues, including Evra, Kelman, Kindler, Keevash, Minzer, and Safra.
Syllabus
Noam Lifshitz: Inverse results for isoperimetric inequalities I
Taught by
Hausdorff Center for Mathematics
Related Courses
Analytic Combinatorics, Part IPrinceton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera