Skip to main content
SpringerLink
Log in

Computing invariants of reductive groups in positive characteristic

  • Published:
Transformation Groups Aims and scope Submit manuscript

Abstract

This paper gives an algorithm for computing invariant rings of reductive groups in arbitrary characteristic. Previously, only algorithms for linearly reductive groups and for finite groups have been known. The key step is to find a separating set of invariants.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Technische Universitat Munchen, Zentrum Mathematik–M11, Boltzmannstrasse 3, D-85748 Garching, Germany

    Gregor Kemper

Authors
  1. Gregor Kemper
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gregor Kemper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kemper, G. Computing invariants of reductive groups in positive characteristic. Transformation Groups 8, 159–176 (2003). https://doi.org/10.1007/s00031-003-0305-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00031-003-0305-1

Keywords

Search

Navigation