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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a5fad37a056f
DTSTART;TZID=America/Toronto:20260724T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260724T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 inggroup-mahtab-alghasi-local-dyadic-conjecture
SUMMARY:CombOpt ReadingGroup -Mahtab Alghasi-The Local Dyadic Conjecture
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\n Mahtab Alghasi\n\nAFFILIATION:\n University of Wat
 erloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: A family of sets $\\mathcal{C}$
  over a finite ground set\n$E(\\mathcal{C})$ is a clutter if no member of 
 $\\mathcal{C}$ properly\ncontains another. A clutter is ideal if its cover
 ing polyhedron is\nintegral. A rational number whose denominator is a powe
 r of two is\ncalled \\emph{dyadic}.\n\nA longstanding conjecture of Paul S
 eymour\, known as the Dyadic\nConjecture\, predicts that\, for every ideal
  clutter\, the dual of the\nset covering linear program admits an optimal 
 solution in which all\nvariables take dyadic values. We present a local ve
 rsion of this\nconjecture and provide evidence for it by proving the propo
 sed local\nstatement for binary clutters under certain assumptions. \nThis
  is joint work with Bertrand Guenin and Levent Tuncel.
DTSTAMP:20260721T173239Z
END:VEVENT
END:VCALENDAR