G-complete reducibility in non-connected groups

Michael Bate; Sebastian Herpel; Benjamin Martin; Gerhard Rohrle

doi:10.1090/S0002-9939-2014-12348-3

G-complete reducibility in non-connected groups

Michael Bate, Sebastian Herpel, Benjamin Martin, Gerhard Rohrle

Research output: Contribution to journal › Article › peer-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 G⁰ is G⁰-cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.

Original language	English
Pages (from-to)	1085-1100
Number of pages	16
Journal	Proceedings of the American Mathematical Society
Volume	143
Issue number	3
Early online date	12 Nov 2014
DOIs	https://doi.org/10.1090/S0002-9939-2014-12348-3
Publication status	Published - Mar 2015

Keywords

G -complete reducibility
non- connected reductive groups

Access to Document

10.1090/S0002-9939-2014-12348-3Licence: Unspecified

Accepted Manuscript
©2014 American Mathematical Society. First published in Proceedings of the American Mathematical Society 143 (2015), 1085-1100, published by the American Mathematical Society.
Accepted author manuscript, 381 KBLicence: Other

http://www.ams.org/publications/ctp.pdf

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

Ben Martin
- School of Natural & Computing Sciences, Mathematical Science - Personal Chair
- Mathematical Sciences (Research Theme)
Person: Academic

Cite this

@article{30ea474e55904d24a46e441702de519c,

title = "G-complete reducibility in non-connected groups",

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. ",

keywords = "G -complete reducibility, non- connected reductive groups",

author = "Michael Bate and Sebastian Herpel and Benjamin Martin and Gerhard Rohrle",

note = "The authors acknowledge the financial support of the DFG-priority programme SPP1388 “Representation Theory” and Marsden Grants UOC0501, UOC1009 and UOA1021. Part of the research for this paper was carried out while the authors were staying at the Mathematical Research Institute Oberwolfach supported by the “Research in Pairs” programme. The second author acknowledges additional support from ERC Advanced Grant No. 291512. The authors are grateful to the referee for helpful suggestions, including a strengthening of Proposition 3.4.",

year = "2015",

month = mar,

doi = "10.1090/S0002-9939-2014-12348-3",

language = "English",

volume = "143",

pages = "1085--1100",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "3",

}

TY - JOUR

T1 - G-complete reducibility in non-connected groups

AU - Bate, Michael

AU - Herpel, Sebastian

AU - Martin, Benjamin

AU - Rohrle, Gerhard

N1 - The authors acknowledge the financial support of the DFG-priority programme SPP1388 “Representation Theory” and Marsden Grants UOC0501, UOC1009 and UOA1021. Part of the research for this paper was carried out while the authors were staying at the Mathematical Research Institute Oberwolfach supported by the “Research in Pairs” programme. The second author acknowledges additional support from ERC Advanced Grant No. 291512. The authors are grateful to the referee for helpful suggestions, including a strengthening of Proposition 3.4.

PY - 2015/3

Y1 - 2015/3

N2 - 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.

AB - 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.

KW - G -complete reducibility

KW - non- connected reductive groups

UR - http://www.ams.org/publications/ctp.pdf

U2 - 10.1090/S0002-9939-2014-12348-3

DO - 10.1090/S0002-9939-2014-12348-3

M3 - Article

VL - 143

SP - 1085

EP - 1100

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 3

ER -

G-complete reducibility in non-connected groups

Abstract

Keywords

Access to Document

Ben Martin

Cite this