Show simple item record

dc.contributor.authorBate, Michael
dc.contributor.authorHerpel, Sebastian
dc.contributor.authorMartin, Benjamin
dc.contributor.authorRöhrle, Gerhard
dc.date.accessioned2013-04-10T12:00:01Z
dc.date.accessioned2016-10-05T14:13:54Z
dc.date.available2013-04-10T12:00:01Z
dc.date.available2016-10-05T14:13:54Z
dc.date.issued2013-04-10
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1058
dc.descriptionResearch in Pairs 2012en_US
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2013,09
dc.subjectG-complete Reducibilityen_US
dc.subjectNon-Connected Reductive Groupsen_US
dc.titleG-complete reducibility in non-connected groupsen_US
dc.typePreprinten_US
dc.rights.licenseDieses 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.de
dc.rights.licenseThis 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.en
dc.identifier.doi10.14760/OWP-2013-09
local.scientificprogramResearch in Pairs 2012
local.series.idOWP-2013-09
local.subject.msc20
dc.identifier.urnurn:nbn:de:101:1-2024031912362526616482
dc.identifier.ppn1652237534


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record