An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
From MaRDI portal
Publication:1401909
Symbolic computation and algebraic computation (68W30) Actions of groups on commutative rings; invariant theory (13A50) Linear algebraic groups and related topics (20G99) Computational aspects and applications of commutative rings (13P99) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Recommendations
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1361365 (Why is no real title available?)
- Algorithms in invariant theory
- An algorithm to calculate optimal homogeneous systems of parameters
- An algorithm to compute the kernel of a derivation up to a certain degree
- Calculating invariant rings of finite groups over arbitrary fields
- Computation of invariants for reductive groups
- Computational invariant theory
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Computer algebra methods for equivariant dynamical systems
- Generating a Noetherian normalization of the invariant ring of a finite group
- Geometric Quotients of Unipotent Group Actions
- Note on a counterexample to Hilbert's fourteenth problem given by P. Roberts
- On the 14-th Problem of Hilbert
- The Magma algebra system. I: The user language
This page was built for publication: An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401909)