Abstract
In this paper, effectiveness of involutive criteria in the elimination of useless prolongations when computing polynomial Janet bases, which are typical representatives of involutive bases, is discussed. One of the results of this study is that the role of the criteria in an involutive algorithm is not as important as in the Buchberger algorithm. It is shown also that these criteria affect the growth of intermediate coefficients.
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.
