F4-invariant Algorithm for Computing SAGBI-Gröbner Bases

Abstract : This paper introduces a new algorithm for computing SAGBI-Gr\"obner bases for ideals of invariant rings of permutation groups. This algorithm is based on $\F_4$ algorithm. A first implementation of this algorithm has been made in SAGE and MAPLE computer algebra systems and have been successfully tried on a number of examples.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2015, 573, pp.54-62. 〈http://www.sciencedirect.com/science/journal/03043975〉. 〈10.1016/j.tcs.2015.01.045〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01114025
Contributeur : Annick Valibouze <>
Soumis le : vendredi 6 février 2015 - 18:32:17
Dernière modification le : jeudi 21 mars 2019 - 14:38:53

Identifiants

Citation

Marziyeh Boroujeni, Abdolali Basiri, Sajjad Rahmany, Annick Valibouze. F4-invariant Algorithm for Computing SAGBI-Gröbner Bases. Theoretical Computer Science, Elsevier, 2015, 573, pp.54-62. 〈http://www.sciencedirect.com/science/journal/03043975〉. 〈10.1016/j.tcs.2015.01.045〉. 〈hal-01114025〉

Partager

Métriques

Consultations de la notice

178