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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7a9f116d1
DTSTART;TZID=America/Toronto:20240718T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240718T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-en
 umerative-combinatorics-laura-pierson
SUMMARY:Algebraic & Enumerative Combinatorics - Laura Pierson
CLASS:PUBLIC
DESCRIPTION:TITLE: Two variations of the chromatic symmetric function\n\nS
 PEAKER:\n Laura Pierson\n\nAFFILIATION:\n University of Waterloo\n\nLOCATI
 ON:\n MC 5479\n\nABSTRACT: The /chromatic symmetric function/ is a symme
 tric function\ngeneralization of the chromatic polynomial that encodes the
  ways to\ncolor a graph such that no two adjacent vertices get the same co
 lor.\nWe will discuss two different analogues of the chromatic symmetric\n
 function: a K-theoretic analogue called the /Kromatic symmetric\nfunction
 /\, and a categorification called the /chromatic symmetric\nhomology/. We 
 show that certain properties of a graph can be recovered\ngiven its Kromat
 ic symmetric function\, and we give some formulas for\nspecial cases of th
 e chromatic symmetric homology.
DTSTAMP:20260403T083023Z
END:VEVENT
END:VCALENDAR