G-complete reducibility in non-connected groups

Loading...
Thumbnail Image
Date
2013
Volume
2013-09
Issue
Journal
Series Titel
Book Title
Publisher
Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach
Link to publishers version
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.

Description
Keywords
G-complete reducibility, non-connected reductive groups
Citation
Bate, M., Herpel, S., Martin, B., & Röhrle, G. (2013). G-complete reducibility in non-connected groups (Vol. 2013-09). Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach. https://doi.org//10.14760/OWP-2013-09
Collections
License
This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.
Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.