Two-row $W$-graphs in affine type $A$
Combinatorics
2019-08-29 v2 Representation Theory
Abstract
For affine symmetric groups we construct finite -graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite -graphs in an affine type. We compare our construction with quotients of periodic -graphs defined by Lusztig. Under certain positivity assumption on the latter the two are shown to be isomorphic.
Cite
@article{arxiv.1908.04707,
title = {Two-row $W$-graphs in affine type $A$},
author = {Dongkwan Kim and Pavlo Pylyavskyy},
journal= {arXiv preprint arXiv:1908.04707},
year = {2019}
}
Comments
comments welcome! v2:minor corrections