Computing invariants of algebraic groups in arbitrary characteristic (Q2474315)

From MaRDI portal
Revision as of 08:17, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Computing invariants of algebraic groups in arbitrary characteristic
scientific article

    Statements

    Computing invariants of algebraic groups in arbitrary characteristic (English)
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    Let \(G\) be an affine algebraic group acting on an affine variety \(X\). This paper presents an algorithm for computing generators of the invariant ring \(K[V]^{G}\) in the case where \(G\) is reductive. Furthermore, the authors develop an algorithm which computes \(K[X]^{G}\) in term of a so-called colon-operation in the case of G is connected and unipotent. Under the addditional hypothesis that \(K[X]\) is factorial, they present an algorithm that finds a quasi-affine variety whose coordinate ring is \(K[X]^{G}\). Along the way, the authors develop some techniques for dealing with nonfinitely generated algebras by introducing the finite generation ideal, for example, give an algorithm for computing the intersection of a finitely generated domain over a field and the field of fractions of a subalgebra.
    0 references
    0 references
    0 references
    invariant
    0 references
    algebraic groups
    0 references
    algorithm
    0 references
    unipotent
    0 references