Termination of algorithm for computing relative Gröbner bases and difference differential dimension polynomials
Guanli HUANG , Meng ZHOU
Front. Math. China ›› 2015, Vol. 10 ›› Issue (3) : 635 -648.
Termination of algorithm for computing relative Gröbner bases and difference differential dimension polynomials
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 Gröbner bases will terminate. Also the relative Gröbner bases exist under the condition. Finally, we prove the algorithm for computation of the bivariate dimension polynomials in difference-differential modules terminates.
Relative Gröbner basis / difference-differential module / bivariate dimension polynomial / termination of algorithm
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
Higher Education Press and Springer-Verlag Berlin Heidelberg
/
| 〈 |
|
〉 |