Date: Friday, February 12, 2016
Location: 4088 East Hall (3:10 PM to 4:00 PM)
Title: Matrix Ball Construction for affine RobinsonSchensted Correspondence
Abstract:
In his study of KazhdanLusztig cells in affine type A, Shi has introduced an affine analog of RobinsonSchensted correspondence. We generalize the MatrixBall Construction of Viennot and Fulton to give a more combinatorial realization of Shi's algorithm. As a byproduct, we also give a way to realize the affine correspondence via the usual RobinsonSchensted bumping algorithm. Next, inspired by Honeywill, we extend the algorithm to a bijection between the extended affine symmetric group and collection of triples (P, Q, r) where P and Q are tabloids and r is a dominant weight.
Files:
Speaker: Michael Chmutov
Institution: U Minnesota
Event Organizer:
