$G$-complete reducibility in non-connected groups
$G$-complete reducibility in non-connected groups
复制标题
$G$-非连接组中的完全可还原性
DOI：
10.1090/s0002-9939-2014-12348-3
复制
发表时间：
2014
影响因子：
1
通讯作者：
Bate M
中科院分区：
文献类型：
--
作者：
Bate M
本文给出了一个判定非连通可约群的子群是否-完全可约的算法。该算法由一系列的减少，在每一步中，我们执行的操作涉及连接组，如检查是否某一子群的fis-cr。这基本上减少了问题的决定完全约简的情况下，连接。引用
In this paper we present an algorithm for determining whether a subgroupof a non-connected reductive groupis-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup ofis-cr. This essentially reduces the problem of determining-complete reducibility to the connected case. References