G-complete reducibility in non-connected groups.

From MaRDI portal
Publication:5496445

DOI10.1090/S0002-9939-2014-12348-3zbMATH Open1314.20036arXiv1303.0963MaRDI QIDQ5496445FDOQ5496445


Authors: Michael Bate, Sebastian Herpel, Benjamin Martin, Gerhard Röhrle Edit this on Wikidata


Publication date: 2 February 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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 G^0 is G^0 -cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.


Full work available at URL: https://arxiv.org/abs/1303.0963




Recommendations




Cites Work


Cited In (4)





This page was built for publication: \(G\)-complete reducibility in non-connected groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496445)