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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f50d900ef1b
DTSTART;TZID=America/Toronto:20260210T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260210T170000
URL:https://uwaterloo.ca/pure-mathematics/events/dimer-model-learning-semin
 ar
SUMMARY:Dimer Model Learning Seminar
CLASS:PUBLIC
DESCRIPTION:LEIGH FOSTER\, UNIVERSITY OF WATERLOO\n\n_Proving the count of 
 boxed plane partitions (box stackings) via the\nRSK algorithm_\n\nThe stud
 y of lozenge tilings and of the dimer model is a\nwell-established area of
  research\, going back to the 1960's and still\nsubject to active research
  at present. We will start the learning\nseminar on this topic with a seri
 es of three meetings giving an\nintroduction to the dimer model in its sin
 gle-dimer version\, and\nconsidered on a finite hexagonal grid. \n\nThis w
 eek\, we will present a proof of Percy MacMahon's generating\nfunctions pl
 ane partitions. We will use (a modified version of) the\nRSK algorithm\, a
 lso known as the Robinson–Schensted–Knuth\ncorrespondence. This gives 
 a count of dimer covers on the hexagonal\ngrid\, lozenge tilings of the tr
 iangular lattice\, and plane partitions\,\nas well as other combinatorial 
 objects. \n\nNo prior knowledge of RSK\, plane partitions\, or much combin
 atorics is\nrequired\, and participation is encouraged! Come and learn and
  ask your\nquestions. \n\nMC 5403
DTSTAMP:20260501T203112Z
END:VEVENT
END:VCALENDAR