1999/08/19 by Marc A. A. van Leeuwen, van Leeuwen, Marc A. A.
Mathematics · #05E05 #05E10 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05E05 #msc:05E10
paper · pdf · doi:10.48550/arxiv.math/9908099
29 pages
arxiv created 1999/08/19 · openalex publication_date 1999/08/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.