The Littlewood-Richardson rule, and related combinatorics
Combinatorics
2007-05-23 v1
Abstract
An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section relating these fairly modern techniques to earlier work on the Littlewood-Richardson rule.
Cite
@article{arxiv.math/9908099,
title = {The Littlewood-Richardson rule, and related combinatorics},
author = {Marc A. A. van Leeuwen},
journal= {arXiv preprint arXiv:math/9908099},
year = {2007}
}
Comments
29 pages