Effective Invariant Theory of Permutation Groups using Representation Theory

Abstract

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner combinatorial description of the invariant ring.

Draft version, the corrected full version is available at http://www.springer.com/

References in corpus (2)

• Minimal generating sets of non-modular invariant rings of finite groups
• Fast Computation of Secondary Invariants