Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.01270

On Kostant's weight $q$-multiplicity formula for $\mathfrak{sl}_{4}(\mathbb{C})$

Rebecca E. Garcia·Pamela E. Harris·Marissa Loving·Lucy Martinez·David Melendez·Joseph Rennie·Gordon Rojas Kirby·Daniel Tinoco
View original source ↗Read source document ↗Export metadata ↓

Abstract

The $q$-analog of Kostant's weight multiplicity formula is an alternating sum over a finite group, known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. This formula, when evaluated at $q=1$, gives the multiplicity of a weight in a highest weight representation of a simple Lie algebra. In this paper, we consider the Lie algebra $\mathfrak{sl}_4(\mathbb{C})$ and give closed formulas for the $q$-analog of Kostant's weight multiplicity. This formula depends on the following two sets of results. First, we present closed formulas for the $q$-analog of Kostant's partition function by counting restricted colored integer partitions. These formulas, when evaluated at $q=1$, recover results of De Loera and Sturmfels. Second, we describe and enumerate the Weyl alternation sets, which consist of the elements of the Weyl group that contribute nontrivially to Kostant's weight multiplicity formula. From this, we introduce Weyl alternation diagrams on the root lattice of $\mathfrak{sl}_4(\mathbb{C})$, which are associated to the Weyl alternation sets. This work answers a question posed in 2019 by Harris, Loving, Ramirez, Rennie, Rojas Kirby, Torres Davila, and Ulysse.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rebecca E. Garcia, Pamela E. Harris, Marissa Loving, Lucy Martinez, David Melendez, Joseph Rennie, Gordon Rojas Kirby, Daniel Tinoco. 2020-01-05. On Kostant's weight $q$-multiplicity formula for $\mathfrak{sl}_{4}(\mathbb{C})$. https://arxiv.org/abs/2001.01270

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗