2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/78977An 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 pagesCombinatorics05E05, 05E10text