English

Two stability theorems on plethysms of Schur functions

Combinatorics 2025-10-08 v2 Representation Theory

Abstract

The plethysm product of Schur functions corresponds to composing polynomial representations of infinite general linear groups. Finding the plethysm coefficients sνsμ,sλ\langle s_\nu \circ s_\mu, s_\lambda\rangle that express an arbitrary plethysm sνsμs_\nu \circ s_\mu as a sum λsνsμ,sλsλ\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 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.

Keywords

Cite

@article{arxiv.2505.06104,
  title  = {Two stability theorems on plethysms of Schur functions},
  author = {Rowena Paget and Mark Wildon},
  journal= {arXiv preprint arXiv:2505.06104},
  year   = {2025}
}

Comments

134 pages, 12 figures

R2 v1 2026-06-28T23:27:21.099Z