Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis

Abstract

We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure linear algebra inside the invariant ring) by relying on the theory of SAGBI- Gröbner basis. This theory takes, in this special case, a strongly combinatorial flavor, which makes it particularly effective. Our algorithm does not require the computation of a Hironaka decomposition, nor even the computation of a system of parameters, and could be parallelized. Our implementation, as part of the library $permuvar$ for $mupad$, is in many cases much more efficient than the other existing software.

Keywords

• permutation group
• invariant theory
• discrete mathematics
• minimal generating set
• mupad
• permuvar
• sagbi-gröbner basis
• hironaka decomposition
• [info] computer science [cs]
• [math.math-co] mathematics [math]/combinatorics [math.co]
• [info.info-cg] computer science [cs]/computational geometry [cs.cg]
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
• [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]