On the theory of graded structures
Journal of Symbolic Computation
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Algorithmic algebra
Groebner basis under composition II
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Groebner basis under composition I
Journal of Symbolic Computation
Reduced Gro¨bner bases under composition
Journal of Symbolic Computation
The term orderings which are compatible with composition II
Journal of Symbolic Computation
Hi-index | 0.00 |
Let K[x1,…,xn]be a polynomial ring over a field K in variables x1,…,xn, and K[y1,…,ym] be a polynomial ring over a field K in variables y1,…,ym. m ≱ n. Let &THgr; = (&thgr;1,…,&thgr;n) be an ordered n-tuple of non-constant polynomials in K[y1,…,ym]. For any finite set F of K[x1,…,xn], let F o &THgr; be the set obtained from F by replacing xi; by &thgr;i, thus for any F e K[x1,…,xn], Fo&THgr; e K[y1,…,ym]. With the above notations, Hong's main theorem [9] and the main theorem of [6] are generalized to general cases with some new proofs.