Lifting algorithms for Gr bner basis computation of invariant ideals
不变理想的Gr bner基提升算法

A polynomial invariant under the action of a finite group can be rewritten into generators of the invariant ring by Gr bner basis method. The key question is how to find an efficient way to compute the Gr bner basis of the invariant ideal which is positive dimensional. We introduce a lifting algorithm for this computation process. If we use straight line program to analyze the complexity result, this process can be done within polynomial time.