Abstract
Gao, Volny and Wang (2010) gave a simple criterion for signature-based algorithms to compute Grobner bases. It gives a unified frame work for computing Grobner bases for both ideals and syzygies, the latter is very important in free resolutions in homological algebra. Sun and Wang (2011) later generalized the GVW criterion to a more general situation (to include the F5 Algorithm). Signature-based algorithms have become increasingly popular for computing Grobner bases. The current paper introduces a concept of factor pairs that can be used to detect more useless J-pairs than the generalized GVW criterion, thus improving signature-based algorithms.
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.
