Symplectic and orthogonal Robinson-Schensted algorithms

Peter Trapa

Harvard University

May 16,
refreshments at 3:45pm


Given any real reductive Lie group, there is a simple geometric framework to produce a constructive bijection from (something like) involutions in the symmetric group to (something like) standard Young tableaux. For instance, when the Lie group is GL(n,C), the parenthetical caveats can be removed, and one recovers the classical Robinson-Schensted algorithm. Of course this algorithm is of combinatorial interest, but it also turns up in many representation theoretic guises (such as the computation of Kazhdan-Lusztig cells for the symmetric group). The purpose of this talk is to consider the algorithms that arise for other classical real Lie groups, establish their basic combinatorial properties, and give some representation theoretic applications (such as the computation of Lusztig-Vogan cells).

Speaker's Contact Info: ptrapa(at-sign)

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)

Page loaded on April 26, 2001 at 09:17 AM. Copyright © 1998-99, Sara C. Billey. All rights reserved.