A Short Proof of Gamas's Theorem
Combinatorics
2009-06-26 v1
Abstract
If \chi^\lambda is the irreducible character of the symmetric group S_n corresponding to the partition \lambda of n then we may symmetrize a tensor v_1 \otimes ... \otimes v_n by \chi^\lambda. Gamas's theorem states that the result is not zero if and only if we can partition the set {v_i} into linearly independent sets whose sizes are the parts of the transpose of \lambda. We give a short and self-contained proof of this fact.
Keywords
Cite
@article{arxiv.0906.4769,
title = {A Short Proof of Gamas's Theorem},
author = {Andrew Berget},
journal= {arXiv preprint arXiv:0906.4769},
year = {2009}
}