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:6ab456a5690d1
DTSTART;TZID=America/Toronto:20260928T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260928T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-kaioke-begay-finitary-and-cofinitary
SUMMARY:Graphs and Matroids - Kaioke Begay- Finitary and Cofinitary Oriente
 d\nMatroids
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Kaioke Begay\n\nAFFILIATION:\n University of Waterlo
 o\n\nROOM:\n MC 6029\n\nABSTRACT: Much like matroids\, oriented matroids 
 can be defined on\nfinite ground sets using a set of circuit axioms. Orien
 ted matroid\nduality is an important property which is difficult to mainta
 in in the\ninfinite setting. One way to define infinite oriented matroids 
 in a\nway that preserves duality is using signed set orthogonality. This\n
 allows for the notion of finitary and cofinitary oriented matroids. An\nor
 iented matroid is called finitary if all of its circuits have finite\nsupp
 ort\, and cofinitary if it is the dual of a finitary oriented\nmatroid. It
  has recently been shown that cofinitary oriented matroids\ndo not necessa
 rily satisfy the circuit axioms. In the finite setting\,\nthere are many w
 ays to define oriented matroids which are equivalent\nto the circuit axiom
 s. Here\, we prove that some of these definitions\nstill hold for cofinita
 ry oriented matroids\, even when the circuit\naxioms fail.
DTSTAMP:20260923T224557Z
END:VEVENT
END:VCALENDAR