English

Restriction coefficients for partitions with at most three columns

Combinatorics 2025-08-28 v2 Representation Theory

Abstract

Let r0r \geq 0, and let λ\lambda and μ\mu be partitions such that λ1r+1\lambda_1 \leq r + 1. We present a combinatorial interpretation of the plethysm coefficient sλ,sμ[sr]\langle s_\lambda, s_\mu[s_r] \rangle. As a consequence, we solve the restriction problem for partitions with at most three columns. That is, for all partitions λ\lambda with λ13\lambda_1 \leq 3, we find a combinatorial interpretation for the multiplicities of the irreducible Sn\mathfrak{S}_n-submodules of the Schur module SλCn\mathbb{S}^\lambda \mathbb{C}^n, considered as an Sn\mathfrak{S}_n-module.

Keywords

Cite

@article{arxiv.2506.11837,
  title  = {Restriction coefficients for partitions with at most three columns},
  author = {Mitchell Lee},
  journal= {arXiv preprint arXiv:2506.11837},
  year   = {2025}
}

Comments

14 pages

R2 v1 2026-07-01T03:15:56.461Z