The term orderings which are compatible with composition II

Authors:
Jinwang Liu;Zhuojun Liu;Mingsheng Wang
Affiliations:
Department of Mathematics, Xiangtan Teachers College, Hunan, 411201, China;Institute of Systems Sciences, AMSS, Chinese Academy of Science, Beijing 100080, China;State Laboratory for Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Venue:
Journal of Symbolic Computation
Year:
2003

Citing 7
Cited 0

Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative 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
Remarks on Gröbner basis for ideals under composition

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Term Orderings on the Polynominal Ring

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polynomial composition is the operation of replacing the variables of a polynomial with other polynomials. Let be a term ordering, if for all terms p and q, p q implies that p o t (Θ) q o lt (Θ), then we say that composition by Θ is compatible with the term ordering. In (J. Symb. Comput. 25 (1998) 643), Hong proposed the question of how to test if a term ordering is compatible with composition. In this paper, by using elementary rational row operations for matrices, we obtain a decision procedure for Hong's question.