BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Swee Hong Chan (Rutgers University)
DTSTART:20241011T200000Z
DTEND:20241011T210000Z
DTSTAMP:20260419T100228Z
UID:MAAGC2024/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MAAGC2024/2/
 ">Complexity of log-concave inequalities in matroids</a>\nby Swee Hong Cha
 n (Rutgers University) as part of MAAGC 2024\n\n\nAbstract\nA sequence of 
 nonnegative real numbers a_1\, a_2\, ...\, a_n\, is log-concave if a_i^2 <
 = a_{i-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 a_i = \\binom{n}{i}\, to intricate inequalities 
 that have taken decades to resolve\, such as the number of independent set
 s a_i 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 breakt
 hrough). 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 thi
 s talk\, we provide a rigorous framework to answer this type of questions\
 , by employing a combination of combinatorics\, complexity theory\, and ge
 ometry. This is a joint work with Igor Pak.\n
LOCATION:https://researchseminars.org/talk/MAAGC2024/2/
END:VEVENT
END:VCALENDAR