Matrix-Ball Construction of affine Robinson–Schensted correspondence
Matrix-Ball Construction of affine Robinson–Schensted correspondence
复制标题
仿射 Robinson-Schensted 对应关系的矩阵球构造
DOI:
--
复制
发表时间:
2015
影响因子:
0.7
通讯作者:
E. Yudovina
中科院分区:
文献类型:
--
作者:
Michael Chmutov;P. Pylyavskyy;E. Yudovina
In his study of Kazhdan–Lusztig cells in affine type A, 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 byproduct, 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 the extended affine symmetric group and collection of triples $$(P, Q, \rho )$$(P,Q,ρ) where P and Q are tabloids and $$\rho $$ρ is a dominant weight. The weights $$\rho $$ρ 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.