A comparison of unrestricted dynamic Gröbner basis algorithms (Q2025445)

A Gröbner Basis algorithm is dynamic when it may change the monomial ordering during the computation. Dynamic Gröbner Basis algorithms often yield smaller output bases and ocasionally faster running times than the traditional ones. The present paper proposes three new dynamic unrestricted Gröbner Basis algorithms based on the concept of neighbourhoods for monomial orders. These algorithms are experimentally compared to other dynamic algorithms. The results show that the proposed algorithms produce small bases containing polynomials of low degree, with little overhead.