• G-complete reducibility in non-connected groups 

      [OWP-2013-09] Bate, Michael; Herpel, Sebastian; Martin, Benjamin; Röhrle, Gerhard (Mathematisches Forschungsinstitut Oberwolfach, 2013-04-10)
      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 ...