BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce8b12523aa
DTSTART;TZID=America/Toronto:20251009T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251009T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-graham
SUMMARY:Algebraic and enumerative combinatorics seminar-Graham Denham
CLASS:PUBLIC
DESCRIPTION:TITLE: Distances in trees and inequalities for matroids\n\nSpea
 ker\n Graham Denham\n\nAffiliation\n Western\n\nLocation\n MC 6029\n\nABST
 RACT: The distance matrix of a tree appears in a range of\ncontexts\, fro
 m phylogenetics to physical chemistry.  I will describe\na new result a
 bout the spectrum of this matrix\, one that gives\naffirmative answers to
  two questions about matroid positivity\nproperties.  These are both str
 engthenings of Mason's conjectures\nabout the log-concavity of sequence o
 f numbers of independent sets of\na matroid\, proposed byIgor Pak and by G
 iansiracusa\, Rincón\, Schleis\,\nUlirsch\, respectively.\n\nThis is join
 t work with Federico Ardila\, Sergio Cristancho\,Chris Eur\,\nJune Huh\, a
 nd Botong Wang.\n\nTHERE WILL BE A PRE-SEMINAR PRESENTING RELEVANT BACKGRO
 UND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT 1:30PM.
DTSTAMP:20260402T152818Z
END:VEVENT
END:VCALENDAR