Some algorithms in invariant theory of finite groups
G Kemper, A Steel - … Methods for Representations of Groups and Algebras …, 1999 - Springer
G Kemper, A Steel
Computational Methods for Representations of Groups and Algebras …, 1999•SpringerWe present algorithms which calculate the invariant ring K [V] G of a finite group G. Our focus
of interest lies on the modular case, ie, the case where| G| is divided by the characteristic of
K. We give easy algorithms to compute several interesting properties of the invariant ring,
such as the Cohen-Macaulay property, depth, the β-number and syzygies.
of interest lies on the modular case, ie, the case where| G| is divided by the characteristic of
K. We give easy algorithms to compute several interesting properties of the invariant ring,
such as the Cohen-Macaulay property, depth, the β-number and syzygies.
Abstract
We present algorithms which calculate the invariant ring K[V] G of a finite group G. Our focus of interest lies on the modular case, i.e., the case where |G| is divided by the characteristic of K. We give easy algorithms to compute several interesting properties of the invariant ring, such as the Cohen-Macaulay property, depth, the β-number and syzygies.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果