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
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.
