Details:
Title  Invariant $mathrm G^2mathrm V$ algorithm for computing SAGBIGr\"obner bases.  Author(s)  Amir Hashemi, Benyamin M.Alizadeh, Monireh Riahi  Type  Article in Journal  Abstract  Faugère and Rahmany have presented the invariant F5 algorithm to compute SAGBIGröbner bases of ideals of invariant rings. This algorithm has an incremental structure, and it is based on the matrix version of F5 algorithm to use F5 criterion to remove a part of useless reductions. Although this algorithm is more efficient than the Buchbergerlike algorithm, however it does not use all the existing criteria (for an incremental structure) to detect superfluous reductions. In this paper, we consider a new algorithm, namely, invariant G 2 V algorithm, to compute SAGBIGröbner bases of ideals of invariant rings using more criteria. This algorithm has a new structure and it is based on the G2V algorithm; a variant of the F5 algorithm to compute Gröbner bases. We have implemented our new algorithm in Maple, and we give experimental comparison, via some examples, of performance of this algorithm with the invariant F5 algorithm.  ISSN  16747283; 18691862/e 
URL 
G2V algorithm, invariant F5 algorithm, invariant G2V algorithm, SAGBIGröbner bases 
Language  English  Journal  Sci. China, Math.  Volume  56  Number  9  Pages  17811794  Publisher  Springer, Berlin/Heidelberg; Science in China Press, Beijing  Year  2013  Edition  0  Translation 
No  Refereed 
No 
