𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Invariants of Finite Groups over Fields of Characteristicp

✍ Scribed by David R. Richman


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
578 KB
Volume
124
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

✦ Synopsis


Let V denote a finite-dimensional K vector space and let G denote a finite group of K-linear automorphisms of V. Let V m denote the direct sum of m copies of V and let G act on the symmetric algebra K[V m ] of V m by the diagonal action on V m . A result of Noether implies that, if char K=0, then K[V m ] G can be generated as a K-algebra by polynomials whose degrees are |G|, no matter how large m is. This paper proves that this result no longer holds when the characteristic of K divides |G|. More precisely, it is proved in this case that there is a positive number :, depending only on |G| and char K, such that every set of K-algebra generators of K[V m ] G contains a generator whose degree is :m.


πŸ“œ SIMILAR VOLUMES


Calculating Invariant Rings of Finite Gr
✍ GREGOR KEMPER πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 642 KB

An algorithm is presented which calculates rings of polynomial invariants of finite linear groups over an arbitrary field K. Up to now, such algorithms have been available only for the case that the characteristic of K does not divide the group order. Some applications to the question whether a modu

Invariants of 2Γ—2-Matrices over Finite F
✍ Larry Smith πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 114 KB

Let F q be the finite field with q elements, q ΒΌ p n ; p 2 N a prime, and Mat 2:2 Γ°F q Þ the vector space of 2 Γ‚ 2-matrices over F. The group GLΓ°2; FÞ acts on Mat 2;2 Γ°F q Þ by conjugation. In this note, we determine the invariants of this action. In contrast to the case of an infinite field, where

Invariants of finite groups
✍ J.G Thompson πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 118 KB
Groups of Permutation Polynomials over F
✍ Richard M. Stafford πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 195 KB

Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.