Pivoting in Extended Rings for Computing Approximate Gröbner Bases

Abstract

It is well known that in the computation of Grobner bases arbitrarily small perturbations in the coefficients of polynomials may lead to a completely different staircase, even if the solutions of the polynomial system change continuously. This phenomenon is called artificial discontinuity in Kondratyev’s Ph.D. thesis. We show how such phenomenon may be detected and even “repaired” by using a new variable to rename the leading term each time we detect a “problem”. We call such strategy the TSV (Term Substitutions with Variables) strategy. For a zero-dimensional polynomial ideal, any monomial basis (containing 1) of the quotient ring can be found with the TSV strategy. Hence we can use TSV strategy to relax term order while keeping the framework of Grobner basis method so that we can use existing efficient algorithms (for instance the F5 algorithm) to compute an approximate Grobner basis. Our main algorithms, named TSVn and TSVh, can be used to repair artificial \({\epsilon}\)-discontinuities. Experiments show that these algorithms are effective for some nontrivial problems.