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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
