Algorithmic invariant theory of nonreductive groups (Q1936480): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s12346-011-0059-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079904820 / rank | |||
Normal rank |
Revision as of 03:18, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic invariant theory of nonreductive groups |
scientific article |
Statements
Algorithmic invariant theory of nonreductive groups (English)
0 references
5 February 2013
0 references
Let \(X\) be an affine variety over the algebraically closed field \(K\) and \(G\) a linear algebraic group over \(K\) acting on \(X\). The paper gives a survey of algorithms in invariant theory with an emphasis on nonreductive groups. A new method for computing the ring of invariants \(K[X]^G\) is presented. It is assumed that the invariant field \(K(X)^G\) is equal to the field of fractions of \(K[X]^G\). This is satisfied for unipotent groups. There is also a new result on separating invariants. There exists a separating set of invariants of size and most \(2\cdot\dim(K[X]^G)+1\). Here a subset \(S\subseteq K[X]^G\) is called separating, if the following condition holds for all points \(p, q\in X:\) If there exists \(f\in K[X]^G\) with \(f(p)\neq f(q)\), then there exists \(g\in S\) with \(g(p)\neq g(q)\).
0 references
Invariant theory
0 references
nonreductive groups
0 references
algorithms
0 references