RobinsonSchensted algorithms for Lie groups
Peter Trapa
Institue for Advanced Study
November 13,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

This talk will survey some combinatorial algorithms that arise
in the representation theory of Lie groups. Roughly speaking, given any
real Lie group $G$ two such algorithms emerge  one from the structure
of `good' bases for certain Hecke algebra representations, and the other
from the structure of the canonical bases of Springer representations.
When $G = GL(n,\C)$, they both reduce to the classical RobinsonSchensted
algorithm. The point of this talk is to remove the ponderous
representation theoretic baggage from these algorithms, and instead
concentrate on their combinatorics. One combinatorial consequence is an
interesting partition of the group of $r$signed permutations into
disjoint subsets. When $r=1$ or $2$, the partition recovers the
(weighted) KazhdanLusztig cells for types A and BC.

Speaker's Contact Info: ptrapa(atsign)math.mit.edu
Return to seminar home page
Page loaded on October 23, 1998 at 11:49 AM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

