A generalization of the Littlewood-Richardson rule and the Robinson-Schensted-Knuth correspondence
A generalization of the Littlewood-Richardson rule and the Robinson-Schensted-Knuth correspondence
复制标题
Littlewood-Richardson 规则和 Robinson-Schensted-Knuth 对应关系的推广
DOI:
10.1016/0021-8693(81)90128-9
复制
发表时间:
1981
影响因子:
0.9
通讯作者:
A. Zelevinsky
中科院分区:
文献类型:
--
作者:
A. Zelevinsky
In this paper the intertwining number of representations of the symmetric group S, corresponding to arbitrary skew diagrams, is computed. The answer is obtained in terms of the combinatorial notion of a picture which is essentially contained in [l]. The proof is based on the combinatorial result on pictures generalizing the well-known Robinson-Schensted-Knuth correspondence.Let us give a more detailed account of the contents of this paper. In Section 2 we introduce the combinatorial terminology which will be used in the sequel. The main notions introduced here are those of a skew diagram (we call it simply a diagram), a partition diagram and a picture (ie, a bijection between two diagrams satisfying some conditions). Our terminology is strongly influenced by [2].