Computing invariants of algebraic groups in arbitrary characteristic (Q2474315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0704.2594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of invariants for reductive groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational invariant theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector invariants in arbitrary characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductive groups are geometrically reductive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of the linearly reductive finite subgroup schemes of \(\mathrm{SL}_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the integral closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Frobenius splittings and \(B\)-modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating invariant rings of finite groups over arbitrary fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculation of radical ideals in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing invariants of reductive groups in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the radical of an ideal in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Invariant Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 14-th Problem of Hilbert / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants of a group in an affine ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the fourteenth problem of Hilbert / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant rings and quasiaffine quotients / rank
 
Normal rank

Latest revision as of 18:23, 27 June 2024

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
    0 references
    0 references