Two stability theorems on plethysms of Schur functions
Abstract
The plethysm product of Schur functions corresponds to composing polynomial representations of infinite general linear groups. Finding the plethysm coefficients s sμ, sλ that express an arbitrary plethysm s sμ as a sum Σλ s sμ, sλ sλ 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 μ or . In both theorems μ may be replaced with an arbitrary skew partition. As special cases we obtain all stability results on the plethysm product of two Schur functions in the literature to date. The proofs are entirely combinatorial using plethystic semistandard tableaux with positive and negative entries.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.