Restriction coefficients for partitions with at most three columns
Abstract
Let r ≥ 0, and let λ and μ be partitions such that λ1 ≤ r + 1. We present a combinatorial interpretation of the plethysm coefficient sλ, sμ[sr] . As a consequence, we solve the restriction problem for partitions with at most three columns. That is, for all partitions λ with λ1 ≤ 3, we find a combinatorial interpretation for the multiplicities of the irreducible Sn-submodules of the Schur module Sλ Cn, considered as an Sn-module.
0
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.