Matrix-Ball Construction of affine Robinson-Schensted correspondence
Abstract
In his study of Kazhdan-Lusztig cells in affine type , Shi has introduced an affine analog of Robinson-Schensted correspondence. We generalize the Matrix-Ball Construction of Viennot and Fulton to give a more combinatorial realization of Shi's algorithm. As a biproduct, we also give a way to realize the affine correspondence via the usual Robinson-Schensted bumping algorithm. Next, inspired by Lusztig and Xi, we extend the algorithm to a bijection between extended affine symmetric group and triples where and are tabloids and is a dominant weight. The weights get a natural interpretation in terms of the Affine Matrix-Ball Construction. Finally, we prove that fibers of the inverse map possess a Weyl group symmetry, explaining the dominance condition on weights.
Keywords
Cite
@article{arxiv.1511.05861,
title = {Matrix-Ball Construction of affine Robinson-Schensted correspondence},
author = {Michael Chmutov and Pavlo Pylyavskyy and Elena Yudovina},
journal= {arXiv preprint arXiv:1511.05861},
year = {2017}
}
Comments
62 pages, 32 figures