F4-invariant algorithm for computing SAGBI-Groebner Bases

M. Borujeni , A. Basiri , S. Rahmany , A. Valibouze
Theoretical Computer Science - , 573, 54–62 - February, 2015
Publication year: 2015

Abstract

This paper introduces a new algorithm for computing SAGBI-Gröbner bases for ideals of invariant rings of permutation groups. This algorithm is based on F4 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.