The Littlewood-Richardson rule, and related combinatorics

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.

29 pages

Cited by in corpus (13)

• The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
• Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$
• On Young tableau involutions and patterns in permutations
• Iterative properties of birational rowmotion
• Heisenberg Honeycombs Solve Veneziano Puzzle
• Boolean Witt vectors and an integral Edrei-Thoma theorem
• Schensted-type correspondence, plactic monoid and jeu de taquin for type C
• Super jeu de taquin and combinatorics of super tableaux of type A
• Raising operators and the Littlewood-Richardson polynomials
• On the structures of hive algebras and tensor product algebras for general linear groups of low rank
• An orthosymplectic Pieri rule
• Representations in Strange Duality: Hilbert Schemes paired with higher rank spaces
• Schur functions and alternating sums