Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Complexity of Log-concave Inequalities in Matroids

Institute for Advanced Study via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a mathematical seminar presentation that delves into the complexity analysis of log-concave inequalities in matroids. Learn about the framework for distinguishing between easily provable log-concave inequalities, like binomial coefficients, and more complex cases such as Mason's conjecture regarding independent sets in matroids. Discover how the speaker combines combinatorics, complexity theory, and geometry to create a rigorous framework for analyzing the inherent difficulty of different types of log-concave inequalities. Follow along as the presentation examines the groundbreaking work related to June Huh's resolution of Mason's conjecture in the 2010s and understand the collaborative research conducted with Igor Pak at Rutgers University.

Syllabus

Complexity of Log-concave Inequalities in Matroids - Swee Hong Chan

Taught by

Institute for Advanced Study

Reviews

Start your review of Complexity of Log-concave Inequalities in Matroids

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.