Groebner Bases and Differential Algebra
暂无分享,去创建一个
the set T A of all monomlals in R, such that it is compatible with O. Given a finetely A-generated A-ideal I in R, i.e. an ideal generated by a finite number of A-polynomials and by their derlvatires, usin~ Buchberger's al~orlthm it is possible to find for a fixed order s an ascendin~ chain of ideals I k such thai: I ,k=l(s) when k>)O, bein~ l(s) the ideal of all A-polynomials in I of order less than or equal to s. The constructive knowledge of the ideal I(s) is indeed equivalent to being able to decide if a A-polynomial in R of order s is in I. In fact, the definitions of A-reduction and <-reduction of a A-polynomial with respect to another one are introduced and compared with the definition of reduction given by Rift. So the notion of A-Gr6bner basis arises in natural way but unfortunately there are finitely A-generated ~-ideels that have no such a basis, so this approach cannot be used to solve the membership problem.
[1] Ferdinando Mora,et al. Groebner Bases for Non-Commutative Polynomial Rings , 1985, AAECC.
[2] André Galligo,et al. Some algorithmic questions on ideals of differential operators , 1985 .
[3] Joseph Johnson. Prolongations of integral domains , 1985 .
[4] D. Bayer. The division algorithm and the hilbert scheme , 1982 .
[5] Bruno Buchberger,et al. Some properties of Gröbner-bases for polynomial ideals , 1976, SIGS.