YoVDO

Complexity of Log-Concave Poset Inequalities

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Combinatorics Courses Complexity Theory Courses Binomial Coefficients Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 51-minute lecture on the complexity of log-concave poset inequalities presented by Swee Hong Chan from Rutgers University at IPAM's Integrability and Algebraic Combinatorics Workshop. Delve into the concept of log-concavity in mathematics, examining its occurrence in various contexts from simple binomial coefficients to complex Stanley's inequality for linear extensions of posets. Investigate a rigorous framework that combines combinatorics, complexity theory, and geometry to assess the intrinsic difficulty of different types of log-concave inequalities. Gain insights into the joint work of Chan and Igor Pak as they explore the varying levels of complexity in proving log-concave inequalities and their implications in mathematical research.

Syllabus

Swee Hong Chan - Complexity of log-concave poset inequalities - IPAM at UCLA


Taught by

Institute for Pure & Applied Mathematics (IPAM)

Related Courses

Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera
Introduction to Enumerative Combinatorics
Higher School of Economics via Coursera
Putnam Exam A1 - Putnam Polynomials Puzzle
Wrath of Math via YouTube
Probability
University of Houston-Clear Lake via YouTube
Mathematical Induction - Number Theory
Michael Penn via YouTube