# 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 :
Document type :
Conference papers
Domain :

Cited literature [25 references]

https://hal.inria.fr/hal-01182965
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 11:23:39 AM
Last modification on : Wednesday, November 20, 2019 - 2:29:52 AM
Long-term archiving on: : Friday, May 5, 2017 - 1:16:45 PM

### File

dmAA0123.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01182965, version 1

### Citation

Nicolas Thiéry. Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.315-328. ⟨hal-01182965⟩

Record views