University of Sydney Algebra Seminar

Neil Saunders (City University of London)

Friday 5 May, 12-1pm, Place: Carslaw 375

The Exotic Robinson-Schensted Correspondence

The classical Robinson-Schensted correspondence is an algorithm that describes a bijection between elements of the symmetric group and pairs of standard Young tableaux. This algorithm is combinatorially rich and has many applications to the representation theory of the symmetric group and the general linear group. In 1988, Steinberg discovered a geometric setting for this algorithm coming from the nilpotent cone of the adjoint representation for the general linear group. In this talk, I will describe an exotic Robinson-Schensted algorithm for the Weyl group of type C coming from Kato’s exotic Springer correspondence for the symplectic group. This is joint work with Vinoth Nandakumar and Daniele Rosso.