Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

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

Matt McClinton

Abstract

In combinatorial representation theory, Kostant's weight multiplicity formula $m(λ,μ)$ is a tool that provides a means of determining the multiplicity of a weight $μ$ 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 $λ$ the highest root of $\mathfrak{sl}_{r+1}(\mathbb{C})$, and $μ$ 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.

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

Abstract

In combinatorial representation theory, Kostant's weight multiplicity formula is a tool that provides a means of determining the multiplicity of a weight in the adjoint representation of a simple Lie algebra , and in this work we consider the case of . 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 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 the highest root of , and 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 -multiplicity for any nonempty collection of distinct simple roots.
Paper Structure (4 sections, 17 theorems, 158 equations)

This paper contains 4 sections, 17 theorems, 158 equations.

Table of Contents

  1. Introduction
  2. Weyl Alternation Sets and Products of Fibonacci numbers
  3. A $q$-analog for a sum of two positive roots
  4. The $q$-analog of Kostant's Weight Multiplicity Formula for sums of distinct simple roots

Key Result

Corollary 1.2

Let $\Tilde{\alpha}$ be the highest root in $\mathfrak{sl}_{r+1}(\mathbb{C})$ and let $I\subseteq [r]$ be nonempty with interval partition $I=\bigsqcup_{x=1}^{n(I)}[i_x,j_x]$. Then where $F_n$ denotes the $n$-th Fibonacci number, $\ell_0=i_1$, $\ell_{n(I)+1}=r-j_{n(I)}+1$, and for each $x\in[n(I)]$, $\ell_x=i_{x+1}-j_x+1$.

Theorems & Definitions (30)

  • Definition 1.1: Interval partition of the indexing set $I$
  • Definition 1.2
  • Corollary 1.2
  • Theorem 1.2
  • Corollary 1.2
  • Proposition 2.1
  • proof
  • Lemma 2.2: Proposition 3.1.2 in HarrisThesis
  • Lemma 2.3
  • proof
  • ...and 20 more