![]() |
![]() |
University of Birmingham > Talks@bham > Algebra seminar > The Exotic Robinson-Schensted Correspondence
![]() The Exotic Robinson-Schensted CorrespondenceAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact David Craven. This talk has been canceled/deleted 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 talk is part of the Algebra seminar series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsAnalysis Reading Seminar EPS - College Research Teas Human Computer Interaction seminarsOther talksSignatures of structural criticality and universality in the cellular anatomy of the brain Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems The percolating cluster is invisible to image recognition with deep learning [Friday seminar]: Irradiated brown dwarfs in the desert |