Abstract
For a given finite polynomial set, finding a monomial order such that the given set is already a GrÖbner basis for the ideal generated by the given set with respect to the found monomial order is called GrÖbner basis detection (GBD) problem and there is also its simpler version, called structural GrÖbner basis detection (SGBD) problem. In this short communication, we give algorithms to solve these problems for polynomials with parameters on their coefficients.
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.
