Semi-invariants, equivariants and algorithms (Q1912703): Difference between revisions

The paper reviews some well-known algorithms for computing a fundamental system of invariants of a finite matrix group \(G\). Although draw-backs of these algorithms are well-known: 1. The algorithms only work over a ground field of characteristic 0 or characteristic \(p\), not dividing the order of \(G\). 2. The algorithm for primary invariants does not in general generate primary invariants in lowest possible degree, which makes the computation of secondary invariants costly. An algorithmic solution, which avoids these draw-backs, has recently been given by \textit{Kemper} [J. Symb. Comput. (1996)].