A bound on the complexity for ᵣ modules
A bound on the complexity for ᵣ modules
复制标题
DOI：
10.1090/s0002-9939-1995-1242099-7
复制
发表时间：
1995-02
期刊：
影响因子：
--
通讯作者：
D. Nakano
中科院分区：
文献类型：
--
作者：
D. Nakano
对于群代数，模的复杂性可以通过观察它对初等交换子群的限制来计算。对于限制李代数的限制包络代数上的模，这种说法不成立。设G是连通半单群概型，Gr是第r个Frobenius核.本文给出了G × T模的复杂性的一个上界.进一步，利用L（A）的张量积分解中的单Gr模的复杂度，给出了单Gr模L（k）的复杂度的一个界.
For group algebras the complexity of a module can be computed by looking at its restriction to elementary abelian subgroups. This statement is not true for modules over the restricted enveloping algebras of a restricted Lie algebra. Let G be a connected semisimple group scheme and Gr be the rth Frobenius kernel. In this paper an upper bound on the complexity is provided for Gx T modules. Furthermore, a bound is given for the complexity of a simple Gr module, L(k), by the complexities of the simple G\ modules in the tensor product decomposition of L(A).