Skip to main content

Invariant theory of finite groups

  • Chapter
Algorithms in Invariant Theory

Part of the book series: Texts and Monographs in Symbolic Computation ((TEXTSMONOGR))

Abstract

Let C [x] denote the ring of polynomials with complex coefficients in n variables x = (x1,x2,...,xn). We are interested in studying polynomials which remain invariant under the action of a finite matrix group Γ ⊂ GL(Cn). The main result of this chapter is a collection of algorithms for finding a finite set I1, I2,...,Im of fundamental invariants which generate the invariant subring C[x]Γ. These algorithms make use of the Molien series (Sect. 2.2) and the Cohen-Macaulay property (Sect. 2.3). In Sect. 2.4 we include a discussion of invariants of reflection groups, which is an important classical topic. Sections 2.6 and 2.7 are concerned with applications and special cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag/Wien

About this chapter

Cite this chapter

(2008). Invariant theory of finite groups. In: Algorithms in Invariant Theory. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-211-77417-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-211-77417-5_2

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-77416-8

  • Online ISBN: 978-3-211-77417-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics