An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
DOI10.1016/S0747-7171(03)00033-6zbMATH Open1039.13007OpenAlexW1976969286MaRDI QIDQ1401909FDOQ1401909
Authors: Thomas Bayer 
Publication date: 19 August 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(03)00033-6
Recommendations
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)
Cites Work
- The Magma algebra system. I: The user language
- Computational invariant theory
- Geometric Quotients of Unipotent Group Actions
- Title not available (Why is that?)
- On the 14-th Problem of Hilbert
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Algorithms in invariant theory
- Computer algebra methods for equivariant dynamical systems
- An algorithm to calculate optimal homogeneous systems of parameters
- Calculating invariant rings of finite groups over arbitrary fields
- Title not available (Why is that?)
- Computation of invariants for reductive groups
- Note on a counterexample to Hilbert's fourteenth problem given by P. Roberts
- An algorithm to compute the kernel of a derivation up to a certain degree
- Generating a Noetherian normalization of the invariant ring of a finite group
Cited In (1)
Uses Software
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)
