An algorithmic Littlewood-Richardson rule

Simple item page
dc.creatorLiu, Ricky Ini
dc.date2008-12-02
dc.date.accessioned2026-07-07T12:08:35Z
dc.date.available2026-07-07T12:08:35Z
dc.descriptionWe introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule presented by Coskun. We also present a corollary regarding the Specht modules of the intermediate diagrams.
dc.description12 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0812.0435
dc.identifierhttp://arxiv.org/abs/0812.0435
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209366
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.titleAn algorithmic Littlewood-Richardson rule
dc.typetext

Files

Collections

arXiv