Abstract
Composition is the operation of replacing variables in a polynomial with other polynomials. The main question of this paper is: When does composition commute with Groebner basis computation? We prove that this happens iff the composition is 'compatible' with the term ordering and the nondivisibility. This has a natural application in the computation of Groebner bases of composed polynomials which often arises in real-life problems. © 1998 Academic Press Limited.
Cite
CITATION STYLE
APA
Hong, H. (1998). Groebner basis under composition I. Journal of Symbolic Computation, 25(5), 643–663. https://doi.org/10.1006/jsco.1997.0192
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free