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:69e4649446387
DTSTART;TZID=America/Toronto:20260423T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260423T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-melissa
SUMMARY:Algebraic and Enumerative combinatorics seminar - Melissa Ulrika\nS
 herman-Bennett-Dimer face polynomials in knot theory and cluster\nalgebras
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\nMelissa Ulrika Sherman-Bennett \n\nAFFILIATION:\n U
 niversity of California\, Davis\n\nLOCATION:\n MC 5417\n\nABSTRACT: The s
 et of dimers (aka perfect matchings) of a connected\nbipartite plane graph
  G is a distributive lattice\, as shown by Propp.\nThe order relation on t
 his lattice comes from the \"height\" of a dimer\,\nwhich is a vector of n
 onnegative integers. In this talk\, I'll focus on\nthe dimer face polynomi
 al of G\, which is the height generating\nfunction of all dimers of G. Thi
 s polynomial has close connections to\nknot invariants on the one hand\, a
 nd cluster algebras on the other.\nI'll discuss joint work with Mészáros
 \, Musiker and Vidinas in which\nwe explore these connections. No knowledg
 e of knot theory or cluster\nalgebras will be assumed.\n\nTHERE WILL BE A 
 PRE-SEMINAR PRESENTING RELEVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEV
 EL STARTING AT 1:30PM.
DTSTAMP:20260419T051356Z
END:VEVENT
END:VCALENDAR