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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e4cc9b1460
DTSTART;TZID=America/Toronto:20201210T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20201210T130000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-laura-colmenarejo
SUMMARY:Algebraic Combinatorics Seminar - Laura Colmenarejo
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Chromatic symmetric functions of Dyck paths
  and $q$-rook\ntheory\n\nSpeaker:\n Laura Colmenarejo\n\nAffiliation:\n UM
 ass Amherst\n\nZoom:\n Contact Karen Yeats\n\nABSTRACT:\n\nGiven a graph a
 nd a set of colors\, a coloring of the graph is a\nfunction that associate
 s each vertex in the graph with a color. In\n1995\, Stanley generalized th
 is definition to symmetric functions by\nlooking at the number of times ea
 ch color is used and extending the\nset of colors to $\\mathbb{Z}^+$. In 2
 012\, Shareshian and Wachs\nintroduced a refinement of the chromatic func
 tions for ordered graphs\nas $q$-analogues.\n 
DTSTAMP:20250521T215937Z
END:VEVENT
END:VCALENDAR