Abstract
Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K [X]G in the case where G is reductive. Furthermore, we address the case where G is connected and unipotent, so the invariant ring need not be finitely generated. For this case, we develop an algorithm which computes K [X]G in terms of a so-called colon-operation. From this, generators of K [X]G can be obtained in finite time if it is finitely generated. Under the additional hypothesis that K [X] is factorial, we present an algorithm that finds a quasi-affine variety whose coordinate ring is K [X]G. Along the way, we develop some techniques for dealing with nonfinitely generated algebras. In particular, we introduce the finite generation ideal.
| Original language | English |
|---|---|
| Pages (from-to) | 2089-2129 |
| Number of pages | 41 |
| Journal | Advances in Mathematics |
| Volume | 217 |
| Issue number | 5 |
| DOIs | |
| State | Published - 20 Mar 2008 |
Keywords
- Algebraic group
- Algorithm
- Invariant theory
- Reductive group
- Unipotent group
Fingerprint
Dive into the research topics of 'Computing invariants of algebraic groups in arbitrary characteristic'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver