arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0963math.GR
收藏

非连通群中的G-完全约化

G-complete reducibility in non-connected groups

Michael Bate, Sebastian Herpel, Benjamin Martin, Gerhard Roehrle

摘要:

本文给出了一个判定非连通可约群G的子群H是否G-完全可约的算法。该算法由一系列约简组成;在每一步,我们执行涉及连通群的操作,例如检查G^0的某个子群是否是G^0 -cr。这实质上减少了确定G-完全约简的问题到连通的情况。

英文摘要:

In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-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 of G^0 is G^0 -cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑