Two-row W-graphs in affine type A

Dongkwan Kim, Pavlo Pylyavskyy

Research output: Contribution to journalArticlepeer-review

Abstract

For affine symmetric groups we construct finite W-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of purely combinatorial constructions of finite W-graphs in an affine type. We compare our construction with quotients of periodic W-graphs defined by Lusztig. Under certain positivity assumption on the latter the two are shown to be isomorphic.

Original languageEnglish (US)
Article number107207
JournalAdvances in Mathematics
Volume370
DOIs
StatePublished - Aug 26 2020

Bibliographical note

Publisher Copyright:
© 2020 Elsevier Inc.

Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

Keywords

  • Symmetric group
  • W-graph

Fingerprint Dive into the research topics of 'Two-row W-graphs in affine type A'. Together they form a unique fingerprint.

Cite this