G-complete reducibility in non-connected groups

Michael Bate, Sebastian Herpel, Benjamin Martin, Gerhard Rohrle

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
6 Downloads (Pure)

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 languageEnglish
Pages (from-to)1085-1100
Number of pages16
JournalProceedings of the American Mathematical Society
Volume143
Issue number3
Early online date12 Nov 2014
DOIs
Publication statusPublished - Mar 2015

Keywords

  • G -complete reducibility
  • non- connected reductive groups

Fingerprint Dive into the research topics of '<i>G</i>-complete reducibility in non-connected groups'. Together they form a unique fingerprint.

Cite this