On computing the polynomial invariants of a finite group (Q3726341)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3957434
Language Label Description Also known as
default for all languages
No label defined
    English
    On computing the polynomial invariants of a finite group
    scientific article; zbMATH DE number 3957434

      Statements

      On computing the polynomial invariants of a finite group (English)
      0 references
      0 references
      0 references
      1985
      0 references
      real representation
      0 references
      homogeneous polynomials
      0 references
      invariants
      0 references
      polynomial basis
      0 references
      If \(f_ 1,...,f_ n\), \(t_ 0,...,t_ d\) is a good polynomial basis for \(\rho\), a real representation of a finite group G as \(n\times n\) matrices then \(P(\rho)^ G=\oplus^{d}_{i=0}R[f_ 1,...,f_ n]\) where \(P(\rho)^ G\) is the ring of polynomials associated with \(\rho\) (G). The \(f_ 1,...,f_ n\) are algebraically independent homogeneous polynomials, \(t_ 0=1\) and \(t_ 1,...,t_ d\) are other homogeneous invariants. Given a good polynomial basis the authors show how to construct the same when G is replaced by a subgroup or \(\rho\) is replaced by a direct sum of such representations or \(\rho\) is replaced by itself multiplied by a linear representation. This paper is motivated by three- dimensional crystallographic point groups where things are nice.
      0 references

      Identifiers