This paper is about algorithmic invariant theory as it is required within equivariant dynamical systems. The question of generic bifurcation equations (arbitrary equivariant polynomial vector) requires the knowledge of fundamental invariants and equivariants. We discuss computations which are related to this for finite groups and semi-simple Lie groups. We consider questions such as the completeness of invariants and equivariants. Efficient computations are gained by the Hilbert series driven Buchberger algorithm because computation of elimination ideals is heavily required. Applications such as orbit space reduction are presented. © 1999 Academic Press.
CITATION STYLE
Gatermann, K., & Guyard, F. (1999). Gröbner bases, invariant theory and equivariant dynamics. Journal of Symbolic Computation, 28(1–2), 275–302. https://doi.org/10.1006/jsco.1998.0277
Mendeley helps you to discover research relevant for your work.