Calculating invariant rings of finite groups over arbitrary fields (Q2563697): Difference between revisions

The author gives an algorithm to compute a basis of the algebra \(I=K[x_1, \dots, x_n]^G\) of \(G\)-invariant polynomials, where \(G\) is a finite linear group over a field \(K\) of arbitrary characteristic. Several methods are known to calculate the invariant rings when \(p= \text{char} (K)\) does not divide the order of \(G\). The author's method first calculates ``primary invariants'' \(f_1, \dots, f_n\), homogeneous invariants such that \(I\) is a finitely generated module over \(A= K[f_1, \dots, f_n]\) (Noether's normalization). Next, choose a subgroup \(H\) of \(G\) such that \(p\) does not divide the order of \(H\), and calculate homogeneous generators \(h_1, \dots, h_r\) of the module \(K[x_1, \dots, x_n]^H\) over \(A\) by an existing method. Then, calculate \(c_{i,j} \in A\) such that \(g_i= \Sigma_j c_{i,j} h_j\) are ``secondary invariants'', that is, they form a system of generators of the \(A\)-module \(I\). In this last stage the Gröbner basis methods for modules are employed.