Papers
Topics
Authors
Recent
Search
2000 character limit reached

On multiplicities of maximal weights of $\hat{sl}(n)$-modules

Published 19 Sep 2013 in math.RT | (1309.4969v1)

Abstract: We determine explicitly the maximal dominant weights for the integrable highest weight $\hat{sl}(n)$-modules $V((k-1)\Lambda_0 + \Lambda_s)$, $0 \leq s \leq n-1$, $ k \geq 2$. We give a conjecture for the number of maximal dominant weights of $V(k\Lambda_0)$ and prove it in some low rank cases. We give an explicit formula in terms of lattice paths for the multiplicities of a family of maximal dominant weights of $V(k\Lambda_0)$. We conjecture that these multiplicities are equal to the number of certain pattern avoiding permutations. We prove that the conjecture holds for $k=2$ and give computational evidence for the validity of this conjecture for $k >2$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.