The Littlewood-Richardson rule, and related combinatorics

Simple item page
dc.creatorvan Leeuwen, Marc A. A.
dc.date1999-08-19
dc.date.accessioned2026-07-07T05:30:24Z
dc.date.available2026-07-07T05:30:24Z
dc.descriptionAn 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.
dc.description29 pages
dc.identifierhttps://arxiv.org/abs/math/9908099
dc.identifierhttp://arxiv.org/abs/math/9908099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78977
dc.subjectCombinatorics
dc.subject05E05, 05E10
dc.titleThe Littlewood-Richardson rule, and related combinatorics
dc.typetext

Files

Collections

arXiv