On Invariant Polynomials and Their Application in Field Theory

From MaRDI portal





Let K be a field and G a subgroup of \(S_ m\), the permutation group of m elements. \(S_ m\) and therefore G acts on the polynomial ring \(K[X_ 1,...,X_ m]\), by permuting the variables. A polynomial \(P\in K[X_ 1,...,X_ m]\) is called a G-polynomial if it is invariant under the action of the elements of G. The main object of the paper is to describe an algorithm to find G-polynomials of lowest possible degree. - The problem is basic in field theory. G-polynomials are used in the computation of Galois groups and of Galois resolvent. In the paper the algorithm is applied to certain classes of groups (e.g. solvable transitive groups). Extensive tables are provided. In section 3 resolvents for degree 5 and 6 are computed explicitly.











This page was built for publication: On Invariant Polynomials and Their Application in Field Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778084)