| Title | |
| Author(s) | Karin Gatermann, Frederic Guyard |
| Type | Article in Journal |
| Abstract | 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. |
| Length | 28 |
| File |
|
| URL |
dx.doi.org/10.1006/jsco.1998.0277 |
| Language | English |
| Journal | Journal of Symbolic Computation |
| Volume | 28 |
| Number | 1-2 |
| Pages | 275-302 |
| Year | 1999 |
| Month | July |
| Edition | 0 |
| Translation |
No |
| Refereed |
No |
