Abstract
The invariant theory of finite groups has enjoyed considerable recent interest, as the appearance of the books by Benson [18] and Smith [225] and of many articles on the subject show. In this chapter we focus on computational aspects. As in Chapter 2, the central goal is the calculation of a finite set of generators for the invariant ring, but we will also address some interesting properties which invariant rings of finite groups may or may not have, and how they can be tackled algorithmically. Almost all algorithms treated in this chapter have implementations in various computer algebra systems. Here is an (almost certainly incomplete) list of computer algebra packages that are devoted to invariant theory mostly of finite groups, ordered chronologically.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Derksen, H., Kemper, G. (2002). Invariant Theory of Finite Groups. In: Computational Invariant Theory. Encyclopaedia of Mathematical Sciences, vol 130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04958-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-04958-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07796-8
Online ISBN: 978-3-662-04958-7
eBook Packages: Springer Book Archive