Computing invariants of reductive groups in positive characteristic (Q1397611): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
‎Created a new Item
 
Import recommendations run Q6534273
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00031-003-0305-1 / rank
Normal rank
 
Property / author
 
Property / author: Gregor Kemper / rank
Normal rank
 
Property / author
 
Property / author: Gregor Kemper / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00031-003-0305-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963537379 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00031-003-0305-1 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q4012043 / rank
 
Normal rank
Property / Recommended article: Q4012043 / qualifier
 
Similarity Score: 0.7997967
Amount0.7997967
Unit1
Property / Recommended article: Q4012043 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computing invariants of algebraic groups in arbitrary characteristic / rank
 
Normal rank
Property / Recommended article: Computing invariants of algebraic groups in arbitrary characteristic / qualifier
 
Similarity Score: 0.76998794
Amount0.76998794
Unit1
Property / Recommended article: Computing invariants of algebraic groups in arbitrary characteristic / qualifier
 
Property / Recommended article
 
Property / Recommended article: An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety / rank
 
Normal rank
Property / Recommended article: An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety / qualifier
 
Similarity Score: 0.7532238
Amount0.7532238
Unit1
Property / Recommended article: An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety / qualifier
 
Property / Recommended article
 
Property / Recommended article: Der kanonische Modul eines Invariantenrings. (The canonical module of a ring of invariants) / rank
 
Normal rank
Property / Recommended article: Der kanonische Modul eines Invariantenrings. (The canonical module of a ring of invariants) / qualifier
 
Similarity Score: 0.7491006
Amount0.7491006
Unit1
Property / Recommended article: Der kanonische Modul eines Invariantenrings. (The canonical module of a ring of invariants) / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4012044 / rank
 
Normal rank
Property / Recommended article: Q4012044 / qualifier
 
Similarity Score: 0.7365824
Amount0.7365824
Unit1
Property / Recommended article: Q4012044 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Algorithmic invariant theory of nonreductive groups / rank
 
Normal rank
Property / Recommended article: Algorithmic invariant theory of nonreductive groups / qualifier
 
Similarity Score: 0.73358226
Amount0.73358226
Unit1
Property / Recommended article: Algorithmic invariant theory of nonreductive groups / qualifier
 
Property / Recommended article
 
Property / Recommended article: On polarizations in invariant theory / rank
 
Normal rank
Property / Recommended article: On polarizations in invariant theory / qualifier
 
Similarity Score: 0.7243718
Amount0.7243718
Unit1
Property / Recommended article: On polarizations in invariant theory / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4004222 / rank
 
Normal rank
Property / Recommended article: Q4004222 / qualifier
 
Similarity Score: 0.7231336
Amount0.7231336
Unit1
Property / Recommended article: Q4004222 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The computation of invariant fields and a constructive version of a theorem by Rosenlicht / rank
 
Normal rank
Property / Recommended article: The computation of invariant fields and a constructive version of a theorem by Rosenlicht / qualifier
 
Similarity Score: 0.72145337
Amount0.72145337
Unit1
Property / Recommended article: The computation of invariant fields and a constructive version of a theorem by Rosenlicht / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computation of invariants for reductive groups / rank
 
Normal rank
Property / Recommended article: Computation of invariants for reductive groups / qualifier
 
Similarity Score: 0.7198848
Amount0.7198848
Unit1
Property / Recommended article: Computation of invariants for reductive groups / qualifier
 
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:15, 27 January 2025

scientific article
Language Label Description Also known as
English
Computing invariants of reductive groups in positive characteristic
scientific article

    Statements

    Computing invariants of reductive groups in positive characteristic (English)
    0 references
    6 August 2003
    0 references
    Let \(G\) be a reductive algebraic group over an algebraically closed field \(K\) acting on an affine variety \(X\). Even though reductive groups in positive characteristic are usually not linearly reductive, M.~Nagata has shown that the algebra of invariants \(K[X]^G\) is finitely generated. This paper gives an algorithm for computing a generating set of the algebra \(K[X]^G\). Previously, such algorithms were only known for the cases of linearly reductive groups [\textit{H.~Derksen}, Adv. Math. 141, 366--384 (1999; Zbl 0927.13007)] and finite groups [\textit{G.~Kemper}, J. Symb. Comput. 21, 351--366 (1996; Zbl 0889.13004)]. One may assume that \(X=V\) is a \(G\)-module. The algorithm consists of three steps. At the first step a finite separating set of invariants is computed. This step requires two fairly large Gröbner basis computations, and it is in some ways similar to Derksen's algorithm. The author also proposes a new algorithm that computes all invariants of a given degree and works for any (not necessarily reductive) linear algebraic group \(G\). The second step is the computation of the normalization of a separating subalgebra. Here an adaption of de Jong's algorithm (for computing the normalization of a finitely presented algebra) in the case where the algebra (and consequently its normalization) is embedded into a polynomial algebra is presented. At the third step an inseparable closure is computed. It is proved that the algebra of invariants \(K[V]^G\) coincides with the inseparable closure of the normalization of a finitely generated graded separating subalgebra. The last section of the paper is devoted to concrete implementations (in MAGMA) of the algorithm. In particular, the author computes the degrees of the minimal generating set of invariants for some \(SL(2)\)-representations in binary forms in characteristic \(p=0,2,3,5\).
    0 references
    invariants of reductive algebraic groups
    0 references
    normalization of separating subalgebras
    0 references
    inseparable closure
    0 references
    algorithm for generating set
    0 references
    MAGMA
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references