2000 character limit reached
Pattern avoidance seen in multiplicities of maximal weights of affine Lie algebra representations
Published 3 Sep 2015 in math.RT, math.CO, and math.QA | (1509.01070v2)
Abstract: We prove that the multiplicities of certain maximal weights of $\mathfrak{g}(A{(1)}_{n})$-modules are counted by pattern avoidance on words. This proves and generalizes a conjecture of Misra-Rebecca. We also prove similar phenomena in types $A{(2)}_{2n}$ and $D{(2)}_{n+1}$. Both proofs are applications of Kashiwara's crystal theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.