On combinatoric determination of SU(n) weight multiplicities

From MaRDI portal
Publication:3710657





The author presents a combinatorial method of calculating the multiplicity \(m_{\lambda}(\mu)\) of any weight \(\mu\) in an arbitrary representation \(\lambda\) of \(\mathrm{SU}(n)\). The method depends upon expanding the corresponding character in the form \(\chi_{\lambda}=\det \{h_{i- j+f_ i}\},\) where \(\lambda =(f_ 1,f_ 2,\ldots,f_ n),\) and then using Hammond operators to write the weight multiplicities in terms of coefficients \(\Gamma^{\mu}(n,p)\) for which the author gives both recursion relations and generating functions. These he exploits graphically to evaluate certain weights, especially central weights. Following the notation and terminology of \textit{I. G. Macdonald} [``Symmetric functions and Hall polynomials. Oxford: Clarendon Press (1979; Zbl 0487.20007)] this method amounts to using the expansion \(\chi_{\lambda}=s_{\lambda}=\sum_{\rho}M(s,h)_{\lambda \rho} h_{\rho}\) followed by \(h_{\rho}=\sum_{\mu}M(h,m)_{\rho \mu} m_{\mu}\) to obtain \(\chi_{\lambda}=\sum_{\mu}M(s,m)_{\lambda \mu} m_{\mu}\) where \(M(s,m)_{\lambda \mu}\) is the required weight multiplicity \(m_{\lambda}(\mu)\). The author does not make use of the facts, given by Macdonald, that \(M(s,h)=K'{}^{-1}\), \(M(h,m)=K'K\) and \(M(s,m)=K\) where \(K\) is Kostka's matrix whose elements can be found by enumerating Young tableaux (ibid. p. 56). However, he does rediscover the combinatorial interpretation of \(M(h,m)_{\lambda \mu}\) given by Macdonald (ibid. p. 57) and exploits the fact that \(M(h,m)'=M(h,m)\) to deal with the central weights \((p^ n)\) or \((p+1^ k,p^{n-k})\). In the first case, for example, the required coefficient \(\Gamma^{\mu}(n,p)\) is nothing other than \(M(h,m)_{\rho \mu}\) with \(\rho =(p^ n).\) Quite apart from the enumeration of Young tableaux [\textit{R. P. Stanley}, Stud. Appl. Math. 50, 167--188 (1971; Zbl 0225.05011), the reviewer and \textit{S. P. O. Plunkett}, J. Phys. A 9, 863--887 (1976; Zbl 0557.22009)] and the use of character generators [\textit{R. P. Stanley}, J. Math. Phys. 21, 2321--2326 (1980; Zbl 0585.17006)] there exist other combinatorial methods of calculating \(m_{\lambda}(\mu)\) [\textit{R. M. Delaney} and \textit{B. Gruber}, J. Math. Phys. 10, 252--265 (1969; Zbl 0206.318)] including a method based on the fact that \(h_{\mu}=\sum_{\lambda}M(h,s)_{\mu \lambda} s_{\lambda}\) with \(M(h,s)=K'\) so that \(M(h,s)_{\mu \lambda}=m_{\lambda}(\mu)\).











This page was built for publication: On combinatoric determination of SU(n) weight multiplicities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3710657)