Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.02312 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_μ[s_ν], s_λ\rangle$, when $λ$ has at most two rows, as counting certain marked trees. In the special case $μ=(n)$, this also yields a combinatorial interpretation for the corresponding rectangular Kronecker coefficient $g(λ, (n^k), (n^k))$. While it is easy to express these quantities as differences of counting problems in the complexity class $\mathrm{FP}$, putting the problem in $\#\mathrm{P}$, our interpretations give a positive counting formula over explicit marked trees.