Computing strong regular characteristic pairs with Gröbner bases (Q2229717)

Let \(R=K[x_1,\ldots,x_n]\) be the ring of polynomials in terms of the variables \(x_1,\ldots,x_n\) over a field \(K\). Let us consider the order \(x_1< \cdots <x_n\) on the variables. The greatest variable appearing in a polynomial \(f\in R\) is called the leading variable of \(f\) and is denoted by \(\mathrm{lv}(f)\). Thus, if \(\mathrm{lv}(f)=x_i\), we can write \(f\) as \(gx_i^k+r\) where \(k\) is the highest power of \(x_i\) in \(f\) and the degree of \(r\) in \(x_i\) is lower than \(k\); \(g\) is called the initial of \(f\) and is denoted by \(\mathrm{in}(f)\). An ordered set \(\{f_1,\ldots ,f_t\}\subset R\) is called triangular if \(\mathrm{lv}(f_1)<\cdots <\mathrm{lv}(f_t)\). A triangular set \(\{f_1,\ldots ,f_t\}\) is normal if \(\mathrm{in}(f_i)\) for each \(i\) does not contain \(\{\mathrm{lv}(f_1),\ldots ,\mathrm{lv}(f_t)\}\). A triangular set \(\{f_1,\ldots ,f_t\}\) is called regular, if \(\mathrm{in}(f_i)\) neither zero nor a zero-divisor in \(R/\mathrm{sat}(\langle f_1,\ldots ,f_{i-1}\rangle)\) where the saturation is taken w.r.t. \(\mathrm{in}(f_1)\cdots \mathrm{in}(f_{i-1})\). \textit{D. Wang} [Math. Comput. Sci. 10, No. 4, 479--492 (2016; Zbl 1388.13058)] introduced the notion of the W-characteristic set for a given ideal. Let \(G\) be the reduced Gröbner basis of an ideal \(I\subset R\) w.r.t. the lexicographical ordering. Let \(G(i)\) be the set of the polynomials in \(G\) having \(x_i\) as the leading variable. If this set is non-empty, we denote by \(g_i\) its minimum element w.r.t. the lexicographical ordering. The set \(\{g_1,\ldots,g_n\}\) is called the W-characteristic set of \(I\). If for some \(i\), \(G(i)=\{\}\) then we do not consider the corresponding polynomial in the W-characteristic set of \(I\). A pair \((G, C)\) of polynomial sets is called a strong regular characteristic pair for \(I\) if \(G\) is the reduced Gröbner basis of \(I\) w.r.t. the lexicographical ordering, \(C\) is the W-characteristic set of the ideal \(I\), \(I=\mathrm{sat}(C)\) and \(C\) is regular. The aim of this paper is to describe an algorithm to decompose an arbitrary polynomial set \(F\) into finitely many strong regular characteristic pairs, from which two kinds of representations for the zeros of \(F\) are obtained. The performance of the proposed algorithm is illustrated by several experimental results.