Using Buchbergers algorithm in invariant theory

  • Authors:

  • Manfred Göbel

  • Affiliations:

  • -

  • Venue:
  • ACM SIGSAM Bulletin
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper shows how Groebner bases theory could be used in invariant theory. It presents algorithms for representation, basis-construction and -test for the ring InvK/Gn of Gn-invariant polynomials over the field K for any given group Gn of permutations.