arXiv Analytics

Sign in

arXiv:math/9908099 [math.CO]AbstractReferencesReviewsResources

The Littlewood-Richardson rule, and related combinatorics

Marc A. A. van Leeuwen

Published 1999-08-19Version 1

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.

Comments: 29 pages
Categories: math.CO
Subjects: 05E05, 05E10
Related articles: Most relevant | Search more
arXiv:1203.2727 [math.CO] (Published 2012-03-13, updated 2014-03-01)
The Littlewood-Richardson rule and Gelfand-Tsetlin patterns
arXiv:0908.3540 [math.CO] (Published 2009-08-25, updated 2009-12-04)
Refinements of the Littlewood-Richardson Rule
arXiv:1707.01172 [math.CO] (Published 2017-07-04)
Polynomial bases: positivity and Schur multiplication

Links

Toolbox