Computation of invariants for reductive groups

39Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We will give an algorithm for computing generators of the invariant ring for a given representation of a linearly reductive group. The algorithm basically consists of a single Gröbner basis computation. We will also show a connection between some open conjectures in commutative algebra and finding good degree bounds for generating invariants. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Derksen, H. (1999). Computation of invariants for reductive groups. Advances in Mathematics, 141(2), 366–384. https://doi.org/10.1006/aima.1998.1787

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free