RC-graphs and a generalized Littlewood-Richardson rule

Simple item page
dc.creatorKogan, M.
dc.date2000-10-11
dc.date2000-11-14
dc.date.accessioned2026-07-07T04:37:57Z
dc.date.available2026-07-07T04:37:57Z
dc.descriptionUsing a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0010108
dc.identifierhttp://arxiv.org/abs/math/0010108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60100
dc.subjectCombinatorics
dc.subject14N15
dc.titleRC-graphs and a generalized Littlewood-Richardson rule
dc.typetext

Files

Collections

arXiv