5 citations · 6 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2002
Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles
Mikhail Kogan
Given an rc-graph of permutation and an rc-graph of permutation , we provide an insertion algorithm, which defines an rc-graph in the case when i…
math.CO2000
RC-graphs and a generalized Littlewood-Richardson rule
M. Kogan
Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.