An algorithm for computing plethysm coefficients

DOI10.1016/S0012-365X(97)00127-1MaRDI QIDQ1381839zbMATH OpenOpenAlexFDO

Authors Mei Yang

Publication date 6 September 1998

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00127-1

zbMATH Keywords

algorithmplethysmSchur functions

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Review text

Plethysm is a composition operation on symmetric functions introduced by D. E. Littlewood [see, for instance, \textit{I. G. Macdonald}, Symmetric functions and Hall polynomials. 2nd ed. (1995; Zbl 0824.05059)]. The plethysm \(P[Q]\) of two polynomials \(P\) and \(Q\) is a polynomial obtained by substituting the monomials of \(Q\) as arguments of \(P\). It is well known that for two Schur functions \(s_{\lambda}(x)\) and \(s_{\mu}(x)\) where \(\lambda\) and \(\mu\) are partitions of weight \(m\) and \(n\), respectively, \(s_{\lambda}[s_{\mu}] = \sum c_{\lambda, \mu}^{\gamma} s_{\gamma}(x)\) where \(\gamma\) runs over all partitions of \(n \cdot m\) and where the \(c_{\lambda, \mu}^{\gamma}\) are non-negative integer coefficients. Despite a huge literature there did not exist a formula to compute these coefficients [see, for instance, \textit{Y. M. Chen, A. M. Garsia} and \textit{J. Remmel}, Combinatorics and algebra, Proc. Conf., Boulder/Colo. 1983, Contemp. Math. 34, 109-153 (1984; Zbl 0556.20013)]. Here the author proves such a formula and describes and proves an algorithm to calculate the coefficients. A sufficient condition on \(\lambda, \mu\) and \(\gamma\) is given which ensures that \(c_{\lambda, \mu}^{\gamma} = 0\).

Recommendations

• scientific article; zbMATH DE number 3886117
• The first term in the expansion of plethysm of Schur functions
• A combinatorial rule for the schur function expansion of the PlethysmS(1^a,b)[P_k]

Cites work

• A combinatorial interpretation of the inverse kostka matrix
• scientific article; zbMATH DE number 3886117 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• Invariant theory, tensors and group characters

Cited in

(18)

• On the combinatorics of plethysm
• A new plethysm formula for symmetric functions
• The first term in the expansion of plethysm of Schur functions
• A plethysm formula for \(p_ \mu(\underline x)\circ h_ \lambda(\underline x)\)
• Rectangular symmetries for coefficients of symmetric functions
• scientific article; zbMATH DE number 3886117 (Why is no real title available?)
• scientific article; zbMATH DE number 5253 (Why is no real title available?)
• Plethysms and interacting boson models
• A combinatorial rule for the schur function expansion of the PlethysmS(1^a,b)[P_k]
• On the expansion of the multiplicity-free plethysms \(p_2[s_{(a, b)}]\) and \(p_2[s_{(1^r, 2^t)}]\)
• Plethysm and lattice point counting
• Quasisymmetric expansions of Schur-function plethysms
• Combinatorics of plethysm
• Partial symmetries of iterated plethysms
• A computational and combinatorial exposé of plethystic calculus
• The partition algebra and the plethysm coefficients. II: Ramified plethysm
• Signed combinatorial interpretations in algebraic combinatorics
• The number of irreducibles in the plethysm \(s_{\lambda}[s_m]\)

This page was built for publication: An algorithm for computing plethysm coefficients

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