Combinatorial Applications of the Shearer and Han Inequalities in Graph Theory and Boolean Functions
Hausdorff Center for Mathematics via YouTube
PowerBI Data Analyst - Create visualizations and dashboards from scratch
The Fastest Way to Become a Backend Developer Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Watch a 56-minute mathematics lecture from the Hausdorff Center that explores the combinatorial applications of Shearer's and Han's inequalities in information theory. Discover various formulations of these fundamental inequalities and their powerful applications across graph theory, Boolean functions, and lattice problems. Learn how these information-theoretic tools can be effectively utilized to solve complex combinatorial problems, providing valuable insights into the intersection of information theory and discrete mathematics.
Syllabus
Igal Sason: Combinatorial Applications of the Shearer and Han Inequalities in Graph Theory and ...
Taught by
Hausdorff Center for Mathematics