arXiv Analytics

Sign in

arXiv:1203.2727 [math.CO]AbstractReferencesReviewsResources

The Littlewood-Richardson rule and Gelfand-Tsetlin patterns

Patrick Doolan, Sangjib Kim

Published 2012-03-13, updated 2014-03-01Version 3

We give a survey on the Littlewood-Richardson rule. Using Gelfand-Tsetlin patterns as the main machinery of our analysis, we study the interrelationship of various combinatorial descriptions of the Littlewood-Richardson rule.

Comments: 21 pages, revised: improved exposition, added references
Categories: math.CO, math.RT
Subjects: 05E10, 20G05, 52B20
Related articles: Most relevant | Search more
arXiv:math/0306274 [math.CO] (Published 2003-06-18)
A positive proof of the Littlewood-Richardson rule using the octahedron recurrence
arXiv:math/9908099 [math.CO] (Published 1999-08-19)
The Littlewood-Richardson rule, and related combinatorics
arXiv:1905.09756 [math.CO] (Published 2019-05-23)
Transition between characters of classical groups, decomposition of Gelfand-Tsetlin patterns and last passage percolation

Links

Toolbox