Pure Department Seminar on 12 April 2005
Published on the 05 Apr 2005
Robinson-Schensted Algorithm and Vogan Equivalence
- Speaker: Dr. Jie Du (UNSW)
- Date: Tuesday, 12 April 2005
- Time: 2:00 pm
- Venue: RC-4082, The Red Centre, UNSW
When Kevin Sun gave a talk on his honors thesis, I made some comments on a beautiful application of the Robinson-Schensted algorithm to the Kazhdan-Lusztig cell theory. In this talk I am
going to provide a combinatorial proof for the coincidence of Knuth equivalence classes, Kazhdan--Lusztig left cells and Vogan classes for symmetric groups. This proof involves only Robinson-Schensted algorithm and the combinatorial part of the Kazhdan--Lusztig cell theory.
Enquiries to Catherine Greenhill, 9385 7105, csg@unsw.edu.au