On Invariant Polynomials and Their Application in Field Theory
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.
- Invariants of polynomial vector fields
- On polarizations in invariant theory
- On the existence and number of invariant polynomials
- On invariants of polynomial functions
- Polynomial invariants for the rarita-schwinger operator
- A note on invariant polynomials
- Trace polynomials and invariant theory
- scientific article; zbMATH DE number 1886607
- Polynomial Invariant Theory and Taylor Series
- scientific article; zbMATH DE number 5674969
- Twin sextic algebras
- Solving a system of algebraic equations with symmetries
- A modular method for computing the Galois groups of polynomials
- General formulas for solving solvable sextic equations
- Field extensions defined by power compositional polynomials
- Calculs d'invariants primitifs de groupes finis
- Lagrange resolvents
- On the computation of resolvents and Galois groups
- Invariants for the computation of intransitive and transitive Galois groups
- Specht modules and resolvents of algebraic equations
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)