Using extended Derksen ideals in computational invariant theory
From MaRDI portal
Abstract: The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we present an algorithm for computing invariants of a finite group acting on a finitely generated algebra over a Euclidean ring. This may be viewed as a first step in "computational arithmetic invariant theory." As a special case, the algorithm can compute multiplicative invariant rings. Other algorithms are applicable to nonreductive groups and are, when applied to reductive groups, often faster than the algorithms known to date. The main tool is a generalized and modified version of an ideal that was already used by Derksen in his algorithm for computing invariants of linearly reductive groups. As a further application, these so-called extended Derksen ideals give rise to invariantization maps, which turn an arbitrary ring element into an invariant. For the most part, the algorithms of this paper have been implemented.
Recommendations
Cites work
- scientific article; zbMATH DE number 50185 (Why is no real title available?)
- scientific article; zbMATH DE number 125230 (Why is no real title available?)
- scientific article; zbMATH DE number 1504682 (Why is no real title available?)
- A course in commutative algebra
- Algorithmic invariant theory of nonreductive groups
- Algorithms in invariant theory
- An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety
- Applications of the existence of big Cohen-Macaulay algebras
- Calculating invariant rings of finite groups over arbitrary fields
- Computation of invariants for reductive groups
- Computational invariant theory
- Computing invariants of algebraic groups in arbitrary characteristic
- Computing invariants of reductive groups in positive characteristic
- Lifting standard bases in filtered structures
- Loci in quotients by finite groups, pointwise stabilizers and the Buchsbaum property
- Moving coframes. II: Regularization and theoretical foundations
- Multiplicative invariant theory
- Rational invariants of a group action. Construction and rewriting
- Singularités rationnelles et quotients par les groupes réductifs. (Rational singularities and quotients by reductive groups)
- Smooth and algebraic invariants of a group action: Local and global constructions
- The Magma algebra system. I: The user language
- The computation of invariant fields and a constructive version of a theorem by Rosenlicht
- The direct summand property in modular invariant theory
Cited in
(6)- Algebraic construction of quasi-split algebraic tori
- The computation of invariant fields and a constructive version of a theorem by Rosenlicht
- Effective Computation of Radical of Ideals and Its Application to Invariant Theory
- Computational ideal theory in finitely generated extension rings
- Invariants: Computation and Applications
- Symbolic powers of Derksen ideals
This page was built for publication: Using extended Derksen ideals in computational invariant theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492028)