Computing invariants of algebraic groups in arbitrary characteristic

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring KGX] 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 KGX] in terms of a so-called colon-operation. From this, generators of KGX] can be obtained in finite time if it is finitely generated. Under the additional hypothesis that KX] is factorial, we present an algorithm that finds a quasi-affine variety whose coordinate ring is KGX]. Along the way, we develop some techniques for dealing with nonfinitely generated algebras. In particular, we introduce the finite generation ideal.