Noether's Bound in the Invariant Theory of Finite Groups and Vector Invariants of Iterated Wreath Products of Symmetric Groups (Q4949523)

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 1441374
Language Label Description Also known as
default for all languages
No label defined
    English
    Noether's Bound in the Invariant Theory of Finite Groups and Vector Invariants of Iterated Wreath Products of Symmetric Groups
    scientific article; zbMATH DE number 1441374

      Statements

      Noether's Bound in the Invariant Theory of Finite Groups and Vector Invariants of Iterated Wreath Products of Symmetric Groups (English)
      0 references
      0 references
      2 February 2003
      0 references
      degree bounds
      0 references
      invariant ring
      0 references
      Noether gap
      0 references
      polynomial invariants of a finite group
      0 references
      In 1916, Emmy Noether proved that an invariant ring \(K[V]^G\) of a finite group \(G\) can be generated by invariants of degree at most the group order \(|G|\), provided that char\((K) = 0\) or char\((K) > |G|\). The question whether this bound extends to the case where char\((K) \nmid |G|\) became known as the ``Noether gap''. This question provoked a series of articles, culminating in papers by \textit{P. Fleischmann} [Adv. Math. 156, No. 1, 23-32 (2000; Zbl 0973.13003)] and \textit{J. Fogarty} [Electron. Res. Announc. Am. Math. Soc. 7, 5-7 (2001; Zbl 0980.13003)], who independently gave a complete, affirmative answer. The paper under review is part of the series of articles containing partial results. A main results says that if \(G = G_0 > G_1 > \cdots > G_k = 1\) is a chain of subgroups with char\((K) > [G_i:G_{i+1}]\) for all~\(i\), then Noether's bound holds. There is some overlap with the article by \textit{P. Fleischmann} and \textit{W. Lempken} [in: Finite fields: theory, applications, and algorithms, Waterloo, Ontario, Contemp. Math. 225, 33-41 (1999; Zbl 0936.13004)].
      0 references

      Identifiers