YoVDO

Inverse Results for Isoperimetric Inequalities - Part II

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Graph Theory Courses Combinatorics Courses PAC Learning Courses Isoperimetric Inequalities Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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, a key problem in the Hamming cube's inverse isoperimetric landscape, and its applications to PAC learning and other fields. Gain insights into recent advancements towards resolving this conjecture and related inverse isoperimetric inequalities. The talk draws from collaborative research with Evra, Kelman, Kindler, Keevash, Minzer, and Safra, offering a deep dive into this fascinating area of mathematics over the course of 1 hour and 14 minutes.

Syllabus

Noam Lifshitz: Inverse results for isoperimetric inequalities II


Taught by

Hausdorff Center for Mathematics

Related Courses

Analytic Combinatorics, Part I
Princeton 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