摘要
We introduce the concept of difference-differential degree compatibility on generalized term orders. Then we prove that in the process of the algorithm the polynomials with higher and higher degree would not be produced, if the term orders ＇ and ＇ ＇ are difference-differential degree compatibility. So we present a condition on the generalized orders and prove that under the condition the algorithm for computing relative GrSbner bases will terminate. Also the relative Gr6bner bases exist under the condition. Finally, we prove the algorithm for computation of the bivariate dimension polynomials in difference-differential modules terminates.
We introduce the concept of difference-differential degree compatibility on generalized term orders. Then we prove that in the process of the algorithm the polynomials with higher and higher degree would not be produced, if the term orders ＇ and ＇ ＇ are difference-differential degree compatibility. So we present a condition on the generalized orders and prove that under the condition the algorithm for computing relative GrSbner bases will terminate. Also the relative Gr6bner bases exist under the condition. Finally, we prove the algorithm for computation of the bivariate dimension polynomials in difference-differential modules terminates.
基金
Acknowledgements The authors thank the anonymous referees for their constructive comments and suggestions. This work was supported in part by the National Natural Science Foundation of China （Grant No. 11271040）.
