Abstract
This chapter deals with methods for computing the invariants of an arbitrary polynomial representation of the general linear group GL(Cn). The main algorithm, to be presented in Sect. 4.6, is derived from Hilbert (1893). We will discuss Hilbert’s algorithm from the point of view of Gröbner bases theory. This chapter is less elementary than the previous three. While most of the presentation is self-contained, familiarity with basic notions of commutative algebra and representation theory will be assumed.
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.
Rights and permissions
Copyright information
© 2008 Springer-Verlag/Wien
About this chapter
Cite this chapter
(2008). Invariants of the general linear group. In: Algorithms in Invariant Theory. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-211-77417-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-211-77417-5_4
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-77416-8
Online ISBN: 978-3-211-77417-5
eBook Packages: Computer ScienceComputer Science (R0)