ACO Seminar - Swee Hong Chang February 27, 2025 3:00pm — 4:00pm Location: In Person - Wean Hall 8220 Speaker: SWEE HONG CHANG, Assistant Professor, Department of Mathematics, Rutgers University https://sites.math.rutgers.edu/~sc2518/ A sequence of nonnegative real numbers a1, a2,…, a_n, is log-concave if a 2/1 i/2 ≥ ai-1}a_{i+1} for all i ranging from 2 to n-1. Examples of log-concave inequalities range from inequalities that are readily provable, such as the binomial coefficients ai = (n/i), to intricate inequalities that have taken decades to resolve, such as the number of independent sets a in a matroid M with i elements (otherwise known as the first Mason's conjecture; and was resolved by June Huh in 2010s in a remarkable breakthrough). It is then natural to ask if it can be shown that the latter type of inequalities is intrinsically more challenging than the former. In this talk, we provide a rigorous framework to answer this type of questions, by employing a combination of combinatorics, complexity theory, and geometry. This is a joint work with Igor Pak. Event Website: https://aco.math.cmu.edu/abs-24-25/feb27.html Add event to Google Add event to iCal
