F4-invariant Algorithm for Computing SAGBI-Gröbner Bases - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

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

Résumé

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.

Dates et versions

hal-01114025 , version 1 (06-02-2015)

Identifiants

Citer

Marziyeh Boroujeni, Abdolali Basiri, Sajjad Rahmany, Annick Valibouze. F4-invariant Algorithm for Computing SAGBI-Gröbner Bases. Theoretical Computer Science, 2015, 573, pp.54-62. ⟨10.1016/j.tcs.2015.01.045⟩. ⟨hal-01114025⟩
120 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More