Inverse Results for Isoperimetric Inequalities - Lecture 4
Hausdorff Center for Mathematics via YouTube
UC San Diego Product Management Certificate — AI-Powered PM Training
Learn EDR Internals: Research & Development From The Masters
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the inverse isoperimetric problem in graph theory through this 1-hour 19-minute lecture by Noam Lifshitz at the Hausdorff Center for Mathematics. Delve into the structure of vertex subsets with minimal edge connections to their complements. Examine the Fourier-Entropy-Influence conjecture, a notable problem in this field, and its applications to PAC learning and other areas. Learn about recent progress towards this conjecture and related inverse isoperimetric inequalities. Gain insights from joint works with Evra, Kelman, Kindler, Keevash, Minzer, and Safra.
Syllabus
Noam Lifshitz: Inverse results for isoperimetric inequalities IV
Taught by
Hausdorff Center for Mathematics