Abstract
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 G0 is G0-cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.
Original language | English |
---|---|
Pages (from-to) | 1085-1100 |
Number of pages | 16 |
Journal | Proceedings of the American Mathematical Society |
Volume | 143 |
Issue number | 3 |
Early online date | 12 Nov 2014 |
DOIs | |
Publication status | Published - Mar 2015 |
Keywords
- G -complete reducibility
- non- connected reductive groups
Fingerprint
Dive into the research topics of 'G-complete reducibility in non-connected groups'. Together they form a unique fingerprint.Profiles
-
Ben Martin
- School of Natural & Computing Sciences, Mathematical Science - Personal Chair
Person: Academic