Using Buchbergers algorithm in invariant theory
Manfred Göbel · ACM SIGSAM Bulletin · 1993
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 Inv K/G n of G n -invariant polynomials over the field K for any given group G n of permutations.