Abstract | ||
---|---|---|
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 modular invariant ring is Cohen—Macaulay or isomorphic to a polynomial ring are discussed. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1006/jsco.1996.0017 | J. Symb. Comput. |
Keywords | DocType | Volume |
invariant ring,arbitrary field,finite group | Journal | 21 |
Issue | ISSN | Citations |
3 | Journal of Symbolic Computation | 15 |
PageRank | References | Authors |
2.79 | 2 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gregor Kemper | 1 | 70 | 11.53 |