Weight \(q\)-multiplicities for representations of the exceptional Lie algebra \(\mathfrak{g}_2\) (Q2233210)

The present paper give closed formulas for computing weight \(q\)-multiplicities in a highest weight representation of the exceptional complex Lie algebra \(\mathfrak{g}_{2}\). The multiplicity of a weight \(\mu\) in a highest weight representation with dominant integral highest weight \(\lambda\), denoted by \(m(\lambda, \mu)\), can be computed using Kostant's weight multiplicity formula (as defined by [\textit{H. Refaghat} and \textit{M. Shahryari}, J. Sib. Fed. Univ., Math. Phys. 5, No. 1, 18--24 (2012; Zbl 1505.17008)]): \[m(\lambda, \mu)=\sum\limits_{\sigma \in W}(-1)^{l(\sigma)}\mathfrak{P}(\sigma(\lambda+\rho) -(\mu+\rho))\tag{1} \] where W is the Weyl group of a Lie algebra \(\mathfrak{g}\), \(l(\sigma)\) denotes the length of \(\sigma \in W\), and \(\rho=\frac{1}{2}\sum_{\alpha\in\Phi^{+}}\alpha\) with \(\Phi^{+}\) being the set of positive roots of \(\mathfrak{g}\), and where \(\mathfrak{P}\) denotes Kostant's partition function, which counts the number of ways to express a weight as a nonnegative integral sum of positive roots. The authors study the \(q\)-analog of Kostant's weight multiplicity formula, also known as Kostant's weight \(q\)-multiplicity formula, which is a generalization of equation (1) defined by \textit{G. Lusztig} [Astérisque 101--102, 208--229 (1983; Zbl 0561.22013)]: \[m_{q}(\lambda, \mu)=\sum\limits_{\sigma \in W}(-1)^{l(\sigma)}\mathfrak{P}_{q}(\sigma(\lambda+\rho) -(\mu+\rho))\tag{2} \] In equation (2), \(\mathfrak{P}_{q}\) denotes the \(q\)-analog of Kostant's partition function, which is a polynomial-valued function defined by \[\mathfrak{P}_{q}(\xi)=c_{0}+c_{1}q+c_{2}q^{2}+\cdot\cdot\cdot+c_{n}q^{n}\tag{3} \] where \(c_{i}\) denotes the number of ways to express the weight \(\xi\) as a sum of exactly \(i\) positive roots. In the present paper main result is \emph{Theorem 1.1}: \emph{Theorem 1.1.} Let \(\omega_{1}\) and \(\omega_{2}\) denote the fundamental weights of \(\mathfrak{g}_{2}\). And \(\alpha_{1}\) and \(\alpha_{2}\) denote the simple roots. If \(\lambda =m\omega_{1}+n\omega_{2}\), \(\mu =x\omega_{1}+y\omega_{2}\), and \(m,n,x,y\in \mathbb{N}:=\{0,1,2,3,...\}\), then \(m_{q}(\lambda,\mu) =\left\{ \begin{array} [c]{l} P-Q-R+S+T\text{ if and only if }a,b,c,d,e,f\in \mathbb{N},\\ P-Q-R+S\text{ if and only if }a,b,c,d,e\in \mathbb{N},f\notin \mathbb{N},\\ P-Q-R+T\text{ if and only if }a,b,c,d,f\in \mathbb{N},e\notin \mathbb{N},\\ P-Q-R\text{ if and only if }a,b,c,d\in \mathbb{N},e,f\notin \mathbb{N},\\ P-Q\text{ if and only if }a,b,c\in \mathbb{N},d,e,f\notin \mathbb{N},\\ P-R\text{ if and only if }a,b,d\in \mathbb{N},c,e,f\notin \mathbb{N},\\ P\text{ if and only if }a,b\in \mathbb{N},c,d,e,f\notin \mathbb{N},\\ 0\text{ otherwise} \end{array} \right. \) \ (4) where \(P=\mathfrak{P}_{q}((2m+3n-2x-3y)\alpha_{1}+(m+2n-x-2y)\alpha_{2})\), \(Q=\mathfrak{P}_{q}((m+3n-2x-3y-1)\alpha_{1}+(m+2n-x-2y)\alpha_{2})\), \(R=\mathfrak{P}_{q}((2m+3n-2x-3y)\alpha_{1}+(m+n-x-2y-1)\alpha_{2})\), \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (5) \(S=\mathfrak{P}{q}((m+3n-2x-3y-1)\alpha_{1}+(n-x-2y-2)\alpha_{2})\), and \(T=\mathfrak{P}_{q}((m-2x-3y-4)\alpha_{1}+(m+n-x-2y-1)\alpha_{2}).\) \(a=2m+3n-2x-3y,\) \(b=m+2n-x-2y,\) \(c=m+3n-2x-3y-1,\) \(d=m+n-x-2y-1,\) \(e=n-x-2y-2,\) and \(f=m-2x-3y-4.\) In general, using equation (2) to compute weight \(q\)-multiplicities for representations of \(\mathfrak{g}_{2}\) requires the computation of Kostant's partition function on 12 distinct inputs, as the Weyl group of \(\mathfrak{g}_{2}\) is isomorphic to the dihedral group \(D_{6}\) of order 12. However, \emph{Theorem 1.1} reduces all weight \(q\)-multiplicity computations to at most five such computations. Second result provides a formula for the \(q\)-analog of Kostant's partition function for \(\mathfrak{g}_{2}\), which can be used to compute the terms \(P, Q, R, S, T\) appearing in \emph{Theorem 1.1}. The present paper explicitly computations \(m_{q}(\lambda, \mu)\), and the computations of the proof is polite and easy to understand. Moreover an example using the results of \emph{Theorem 1.1} is also provided to aid understanding.