An algorithm for computing invariants of linear actions of algebraic groups up to a given degree

Authors:
Thomas Bayer
Affiliations:
Institut für Informatik (114), Technische Universität München, 80290 Munich, Germany
Venue:
Journal of Symbolic Computation
Year:
2003

Citing 8
Cited 1

Algorithms in invariant theory

Algorithms in invariant theory
Calculating invariant rings of finite groups over arbitrary fields

Journal of Symbolic Computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computational methods in commutative algebra and algebraic geometry

Computational methods in commutative algebra and algebraic geometry
Generating a noetherian normalization of the invariant ring of a finite group

Journal of Symbolic Computation
An algorithm to calculate optimal homogeneous systems of parameters

Journal of Symbolic Computation
An algorithm to compute the kernel of a derivation up to a certain degree

Journal of Symbolic Computation
SINGULAR — A computer algebra system for polynomial computations

Symbolic computation and automated reasoning

Optimal descriptions of orbit spaces and strata of finite groups

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for computing invariant rings of algebraic groups which act linearly on affine space, provided that degree bounds for the generators are known. The groups need not be finite nor reductive, in particular, the algorithm does not use a Reynolds operator. If an invariant ring is not finitely generated the algorithm can be used to compute invariants up to a given degree.