Restriction coefficients for partitions with at most three columns
Combinatorics
2025-08-28 v2 Representation Theory
Abstract
Let , and let and be partitions such that . We present a combinatorial interpretation of the plethysm coefficient . As a consequence, we solve the restriction problem for partitions with at most three columns. That is, for all partitions with , we find a combinatorial interpretation for the multiplicities of the irreducible -submodules of the Schur module , considered as an -module.
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