Two stability theorems on plethysms of Schur functions
Abstract: The plethysm product of Schur functions corresponds to composition of polynomial representations of infinite general linear groups. Finding the plethysm coefficients $\langle s_\nu \circ s_\mu, s_\lambda\rangle$ that express an arbitrary plethysm $s_\nu \circ s_\mu$ as a sum $\sum_\lambda \langle s_\nu \circ s_\mu, s_\lambda \rangle s_\lambda$ of Schur functions is a fundamental open problem in algebraic combinatorics. We prove two stability theorems for plethysm coefficients under the operations of adding and/or joining an arbitrary partition to either $\mu$ or $\nu$. In both theorems $\mu$ may be replaced with an arbitrary skew partition. As special cases we obtain all stability results on plethysms of Schur functions in the literature to date. The proofs are entirely combinatorial using plethystic semistandard tableaux with positive and negative entries.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.