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

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

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 re...

Full description

Bibliographic Details
Main Author: Nicolas Thiéry
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2001-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
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]
Online Access:https://dmtcs.episciences.org/2285/pdf

Internet

https://dmtcs.episciences.org/2285/pdf

Similar Items