| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435957 | Theoretical Computer Science | 2015 | 9 Pages |
Abstract
This paper introduces a new algorithm for computing SAGBI-Gröbner bases for ideals of invariant rings of permutation groups. This algorithm is based on F4F4 algorithm. A first implementation of this algorithm has been made in SAGE and MAPLE computer algebra systems and has been successfully tried on a number of examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marziyeh Boroujeni, Abdolali Basiri, Sajjad Rahmany, Annick Valibouze,