Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles
| dc.creator | Kogan, Mikhail | |
| dc.date | 2002-06-05 | |
| dc.date.accessioned | 2026-07-07T04:48:54Z | |
| dc.date.available | 2026-07-07T04:48:54Z | |
| dc.description | 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. | |
| dc.description | 22 pages | |
| dc.identifier | https://arxiv.org/abs/math/0206045 | |
| dc.identifier | http://arxiv.org/abs/math/0206045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64230 | |
| dc.subject | Combinatorics | |
| dc.title | Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles | |
| dc.type | text |