Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles

Details Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles

2002-06-05

arxiv.org/abs/math/0206045v1

Mathematics

Combinatorics

22 pages

Scientific paper

Given an rc-graph $R$ of permutation $w$ and an rc-graph $Y$ of permutation $v$, we provide an insertion algorithm, which defines an rc-graph $R\leftarrow Y$ in the case when $v$ is a shuffle with the descent at $r$ and $w$ has no descents greater than $r$ or in the case when $v$ is a shuffle, whose shape is a hook. This algorithm gives a combinatorial rule for computing the generalized Littlewood-Richardson coefficients $c^{u}_{wv}$ in the two cases mentioned above.

Affiliated with

Also associated with

No associations

Rating

Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574452