BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:236586
DTSTAMP:20260521T150844Z
DTSTART;TZID=America/New_York:20260526T140000
DTEND;TZID=America/New_York:20260526T145000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/department-mathematic
 al-sciences-discrete-math-seminar-juliana-tymoczko-smith-college
SUMMARY:Department of Mathematical Sciences Discrete Math Seminar: Juliana 
 Tymoczko, Smith College
DESCRIPTION:\n\n\n      \n      \n\n\n\nTuesday, May 26th, 2026\n2:00pm – 2
 :50pm\nStratton Hall 301\n\nSpeaker:Juliana Tymoczko, Smith College\nTitle
 :An introduction to webs\nAbstract: The combinatorial spider is a diagramm
 atic category that encodes quantum $\mathfrak{sl}_n$ representations.Webs 
 are certain directed planar graphs (withedge-weights),endowed with skein-t
 ype relations that indicate algebraic equivalences. Websare well-understoo
 d in the case $n=2$, when they are essentially noncrossing matchings (or T
 emperley-Lieb diagrams), and in the substantially more complicated case $n
 =3$.\nIn thistalk, we sketch some of the historical evolution ofwebs, from
  Kuperberg's original paper formalizing these ideas to work of Khovanov, F
 ontaine, and Cautis-Kamnitzer-Morrison, as well as the convergence with a 
 collection of combinatorial ideas about plabic graphs from Postnikov, Fomi
 n-Pylyavskyy, Fraser-Lam-Le, and others. We also describe a new approach, 
 joint with Heather M. Russell, that uses a set of colored paths called \em
 ph{strands} to give a global construction for webs, via graph-theoretic an
 d combinatorial notions generalized from smaller dimensions. Time permitti
 ng, we'll also allude to connections to algebraic geometry.\n
END:VEVENT
END:VCALENDAR
