BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:250326
DTSTAMP:20261030T111034Z
DTSTART;TZID=America/New_York:20261102T130000
DTEND;TZID=America/New_York:20261102T135000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/mathematical-sciences
 -department-discrete-mathematics-seminar-jane-coons-wpi
SUMMARY:Mathematical Sciences Department Discrete Mathematics Seminar: Jane
  Coons\, WPI
DESCRIPTION:Speaker: Jane Coons\, WPI\nTitle: The Degree-Bounded Characteri
 stic Imset Polytope\nAbstract: The characteristic imset (CIM) polytope is 
 a 0/1 polytope whose vertices represent Markov equivalence classes of dire
 cted acyclic graphs. Several causal discovery problems can be viewed as so
 lving a linear program over the CIM polytope. However\, since the dimensio
 n of the CIM polytope grows exponentially in the number of nodes of the un
 derlying DAG\, solving these linear programs is computationally intractabl
 e. We introduce the degree-bounded characteristic imset polytope\, whose v
 ertices correspond only to DAGs whose nodes have bounded in-degree k. For 
 fixed k\, the dimension of this polytope grows polynomially in the number 
 of nodes of the DAG. For k=1\, we show that this polytope is a matroid ind
 ependence polytope and we give an extensive list of facets for this polyto
 pe when k=2.
END:VEVENT
END:VCALENDAR