invariant algorithm for computing SAGBI-Grobner bases
This paper introduces a new algorithm for computing SAGBI-Grobner bases for ideals of invariant rings of permutation groups. This algorithm is based on algorithm. A first implementation of this algorithm has been made in SAGE and MAPLE computer algebra systems and has been successfully tried on a nu...
Gespeichert in:
Veröffentlicht in: | Theoretical computer science 2015-03, Vol.573, p.54-62 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper introduces a new algorithm for computing SAGBI-Grobner bases for ideals of invariant rings of permutation groups. This algorithm is based on 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. |
---|---|
ISSN: | 0304-3975 |
DOI: | 10.1016/j.tcs.2015.01.045 |