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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0ee7febee7
DTSTART;TZID=America/Toronto:20240125T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240125T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-santiago-estupinan
SUMMARY:Algebraic and Enumerative Combinatorics - Santiago Estupinan
CLASS:PUBLIC
DESCRIPTION:TITLE: A new shifted Littlewood-Richardson rule\n\nSPEAKER:\n S
 antiago Estupinan\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n 
 MC 5479\n\nThere will be a pre-seminar presenting relevant background at t
 he\nbeginning graduate level starting at 1pm.\n\nABSTRACT: As Littlewood-R
 ichardson rules compute linear representation\ntheory of symmetric groups 
 and cohomology of ordinary Grassmannians\,\nshifted Littlewood-Richardson 
 rules compute analogous projective\nrepresentation theory of symmetric gro
 ups and cohomology of orthogonal\nGrassmannians. The first shifted Littlew
 ood-Richardson rule is due to\nStembridge (1989)\, building on a natural g
 eneralization by Sagan and\nWorley (1979/1984) of the jeu de taquin algori
 thm to shifted Young\ntableaux. We give a new shifted Littlewood-Richardso
 n rule that\nrequires consideration of fewer tableaux than Stembridge's ru
 le and\nappears to involve an easier check on each. Our rule derives from\
 napplying old ideas of Lascoux and Schützenberger (1981) to the study\nof
  Haiman's mixed insertion (1989) and Serrano's shifted plactic\nmonoid (20
 10). (Joint work with Oliver Pechenik).
DTSTAMP:20260404T105703Z
END:VEVENT
END:VCALENDAR