BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:The Exotic Robinson-Schensted Correspondence.
DTSTART:20170224T101500
DTEND:20170224T120000
DTSTAMP:20260528T092932Z
UID:1f9d8219a7a1e03bcb208003c8fd302ac18f4be92cdc894af4d3fe6e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Neil Saunders (City University\, London)\nAbstract: The classi
 cal Robinson-Schensted correspondence is an algorithm that describes a bij
 ection between elements of the symmetric group and pairs of standard Young
  tableaux. This algorithm is combinatorially rich and has many application
 s to the representation theory of the symmetric group and the general line
 ar group. In 1988\, Steinberg discovered a geometric setting for this algo
 rithm coming from the nilpotent cone of the adjoint representation for the
  general linear group. In this talk\, I will describe an exotic Robinson-S
 chensted algorithm for the Weyl group of type C coming from Kato's exotic 
 Springer correspondence for the symplectic group.  
LOCATION:MA A1 10
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR