Abstract
Pan and Wang presented a method for computing uniform Grobner bases for certain ideals generated by polynomials with parametric exponents in 2006, and two criteria were proposed to determine if a uniform Grobner basis can be obtained. This paper gives a new algorithmic approach for computing the uniform Grobner basis such that Pan and Wang’s method could be concluded as a special case. The authors use the method of reduced term order under ring homomorphism to get the reduced uniform Grobner basis. Also the authors point and correct a mistake in Pan and Wang’s method. The result is a generalization of approach of Pan and Wang and one could compute the uniform Grobner basis more efficiently by the new approach.
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 callDisclaimer: 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.
