Orthogonal tableaux and an insertion algorithm for SO(2n + 1)

Orthogonal tableaux and an insertion algorithm for SO(2n + 1)
复制标题

SO(2n 1) 的正交画面和插入算法

DOI:
10.1016/0097-3165(90)90059-6
复制
发表时间:
1990
期刊:
J. Comb. Theory A
影响因子:
--
通讯作者:
S. Sundaram
S. Sundaram
中科院分区:
--
文献类型:
--
作者:
S. Sundaram

文献摘要

被引文献

相似文献

本文给出了SO(2n+ 1)的不可约表示权的一组新的索引表。这些表格被用来产生一个插入计划,它给出了一个组合的描述分解的第k张量幂的自然行动的SO(2n+ 1)到不可约。特别是,在这个分解的多重性明确描述。
A new set of tableaux indexing the weights of the irreducible representations ofSO(2n+ 1) is presented. These tableaux are used to produce an insertion scheme which gives a combinatorial description of the decomposition of thekth tensor power of the natural action ofSO(2n+ 1) into irreducibles. In particular, the multiplicities in this decomposition are described explicitly.