The monomial symmetric functions and the Frobenius map (Q916778)

A definition is given of the Frobenius map F from the centre, \(Z(S_ n)\), of the group algebra of the symmetric group, \(S_ n\), to the space of homogeneous symmetric functions, \(H^ n\), of degree n. Let \(M^{\lambda}=F^{-1}(m_{\lambda})\in Z(S_ n)\) be the preimage of the monomial symmetric function \(m_{\lambda}\). Let \(\sigma \in S_ n\) have cycle structure specified by the partition \(\mu\). It is shown that \(M^{\lambda}(\sigma)\) can be determined combinatorially by enumerating certain \(\lambda\)-domino tabloids T of shape \(\mu\). The proof is effected recursively after first establishing that \(M^{\lambda}(\sigma)\) is an element of the transition matrix linking the power sum symmetric functions to the complete homogeneous symmetric functions. This matrix is the product of the character table of \(S_ n\) and the inverse of the Kostka matrix [\textit{I. G. Macdonald}, ``Symmetric functions and Hall polynomials'' (1979; Zbl 0487.20007)]. A similar combinatorial interpretation is given in the case of the preimage of the ``forgotten'' symmetric functions \(f_{\lambda}\) [\textit{P. Doubilet}, Stud. Appl. Math. 51, 377-396 (1972; Zbl 0274.05008)].