Saved in:
Bibliographic Details
Main Author: McClinton, Matt
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.20053
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915877667995648
author McClinton, Matt
author_facet McClinton, Matt
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_20053
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On the $q$-multiplicity of sums of distinct simple roots of $\mathfrak{sl}_{r+1}(\mathbb{C})$
McClinton, Matt
Combinatorics
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.
title On the $q$-multiplicity of sums of distinct simple roots of $\mathfrak{sl}_{r+1}(\mathbb{C})$
topic Combinatorics
url https://arxiv.org/abs/2603.20053