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:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6b00decc0f209
DTSTART;TZID=America/Toronto:20261106T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261106T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-adam-van-tuyl-building-ideals-graphs-when
SUMMARY:Tutte Colloquium | Adam Van Tuyl\, Building ideals from graphs: whe
 n\nare they (geometrically) vertex decomposable?
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Adam Van Tuyl\n\nAFFILIATION:\n McMaster University\
 n\nLOCATION:\n MC 5501\n\nABSTRACT: Vertex decomposable simplicial comple
 xes and geometrically\nvertex decomposable ideals have a lot of nice struc
 ture: they are\nshellable and Cohen–Macaulay\, and the ideal version is 
 also radical\nand glicci. There are many ways to attach an ideal to a grap
 h\, such as\nedge ideals\, toric ideals\, binomial edge ideals and star\nc
 onfigurations\, and the goal is to exploit the graph structure to\ndecide 
 whether the ideal is (geometrically) vertex decomposable. I\nwill introduc
 e these notions from scratch\, with no commutative algebra\nassumed\, and 
 survey recent joint work\, including a computer search of\nall graphs on 1
 1 vertices and a conjecture for binomial edge ideals.\n 
DTSTAMP:20261120T235908Z
END:VEVENT
END:VCALENDAR