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.