Rational tableaux and the tensor algebra of gln
Rational tableaux and the tensor algebra of gln
复制标题
有理表格和 gln 的张量代数
DOI:
10.1016/0097-3165(87)90077-x
复制
发表时间:
1987
期刊:
影响因子:
--
通讯作者:
J. Stembridge
中科院分区:
文献类型:
--
作者:
J. Stembridge
A generalization of the usual column-strict tableaux (equivalent to a construction of R. C. King) is presented as a natural combinatorial tool for the study of finite dimensional representations ofGLn(C). These objects are called rational tableaux since they play the same role for rational representations ofGLnas ordinary tableaux do for polynomial representations. A generalization of Schensted's insertion algorithm is given for rational tableaux, and is used to count the. multiplicities of the irreducibleGLn-modules in the tensor algebra ofGLn. The problem of counting multiplicities when thekth tensor powergln⊗kis decomposed into modules which are simultaneously irreducible with respect toGLnand the symmetric groupSkis also considered. The existence of an insertion algorithm which describes this decomposition is proved. A generalization of border strip tableaux, in which both addition and deletion of border strips is allowed, is used to describe the characters associated with this decomposition. For largen, these generalized border strip tableaux have a simple structure which allows derivation of identities due to Hanlon and Stanley involving the (largen) decomposition ofgln⊗k.