On the $q$-multiplicity of sums of distinct simple roots of $\mathfrak{sl}_{r+1}(\mathbb{C})$

TL;DR

This paper analyzes the computation of Kostant's weight multiplicity formula for specific weights in sl_{r+1}(\u00a3) and introduces a Fibonacci-based enumeration of the Weyl alternation set, simplifying calculations.

Contribution

It determines the Weyl alternation set for certain weights in sl_{r+1}() and expresses its enumeration via Fibonacci numbers, providing a new combinatorial approach.

Findings

Weyl alternation set is enumerated by a product of Fibonacci numbers.

Explicit formula for the weight q-multiplicity for these weights.

Reduction of computational complexity in calculating Kostant's formula.

Abstract

In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra $\mathfrak{g}$, and in this work we consider the case of $\mathfrak{g}=\mathfrak{sl}_{r+1}(\mathbb{C})$. In practice, performing calculations of Kostant's weight multiplicity formula is computationally intense, as the number of terms in this alternating sum grows factorially as the rank $r$ increases, of which most terms provide zero contribution to the overall sum. In this work, we determine the Weyl alternation set, that is the terms in the alternating sum with nonzero contribution, for integral weights $\lambda$ the highest root of $\mathfrak{sl}_{r+1}(\mathbb{C})$, and $\mu$ any nonempty collection of distinct simple roots. We show that the alternation set is enumerated by a product of Fibonacci numbers, with the product being dependent on the choice of distinct simple roots. Then we compute the weight $q$-multiplicity for any nonempty collection of distinct simple roots.