On products of sl_n characters and support containment
Combinatorics
2007-05-23 v1 Representation Theory
Abstract
Let , , and be dominant weights of satisfying . Let denote the highest weight module corresponding to . Lam, Postnikov, Pylyavskyy conjectured a sufficient condition for to be contained in as -modules. In this note we prove a weaker version of the conjecture. Namely we prove that under the conjectured conditions every irreducible -module which appears in the decomposition of does appear in the decomposition of .
Keywords
Cite
@article{arxiv.math/0608134,
title = {On products of sl_n characters and support containment},
author = {Galyna Dobrovolska and Pavlo Pylyavskyy},
journal= {arXiv preprint arXiv:math/0608134},
year = {2007}
}
Comments
9 pages, 5 figures