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

2 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Keywords :
Document type :
Journal articles

https://hal.archives-ouvertes.fr/hal-01114025
Contributor : Annick Valibouze Connect in order to contact the contributor
Submitted on : Friday, February 6, 2015 - 6:32:17 PM
Last modification on : Wednesday, January 26, 2022 - 3:41:48 AM

### 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. ⟨10.1016/j.tcs.2015.01.045⟩. ⟨hal-01114025⟩

Record views