Triangular systems and factorized Gröbner bases
Polynomials over commutative rings (13B25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30)
Let \(B:=\{f_1,\dots,f_m\}\) be a finite set of polynomials of \(k[x_1,\dots,x_n]\). One basic and widely studied problem in computer algebra is to find suitable ways to describe the zeros of \(f_1,\dots,f_m\). Many different approaches to the problem were presented in the literature. The author here fixes the attention to the notion of factorized Gröbner bases and triangular sets. More precisely, let \(B:=\{f_1,\dots,f_m\}\) and \(C:=\{g_1,\dots,g_k\}\) be two sets of polynomials and let \(Z(B,C)\) be the zeros of \(B\) which are not zeros of \(C\), i.e. \(Z(B,C)\):=\(Z(B)\setminus Z(C)\). The author wants to decompose \(Z(B,C)\) as \(\bigcup Z(B_\alpha,C_\alpha)\) where \(B_\alpha\) are sets of polynomials which allow to better describe their zeros. In the first section of the paper the sets \(B_\alpha\) are obtained from the computation of a Gröbner basis of \(B\) factorizing, in each step of the computation, the obtained polynomials and collecting them in different sets which eventually give the Gröbner bases \(B_\alpha\). This method clearly does not guarantee to split all components of \(Z(B,C)\) but can have practical application. Successively the author recalls the notion of \textsl{triangular sets} for zero dimensional ideals as introduced by \textit{D. Lazard} [see J. Symb. Comput. 13, No. 2, 117-131 (1992; Zbl 0753.13012) and Discrete Appl. Math. 33, No. 1-3, 147-160 (1991; Zbl 0753.13013)] and compares, in some examples, the two methods of factorized Gröbner bases and triangular sets with factorized Gröbner bases with other decomposition methods. Successively, he generalizes the notion of triangular sets to positive dimensional ideals and extends the previously described decomposition techniques to this class of ideals. Some examples conclude the presentation. For the entire collection see [Zbl 0847.00060].
- Decomposition of polynomial sets into characteristic pairs
- scientific article; zbMATH DE number 4132308
- On a method for finding the roots of an ideal
- On decomposing systems of polynomial equations with finitely many solutions
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Solving zero-dimensional algebraic systems
- Ideal basis and primary decompositions: case of two variables
- On radical zero-dimensional ideals
- Gröbner bases and primary decomposition of polynomial ideals
- Working with multivariate polynomials in Maple
- A new method for solving algebraic systems of positive dimension
- On decomposing systems of polynomial equations with finitely many solutions
- A factorization algorithm for \(G\)-algebras and its applications
- On approximate linearized triangular decompositions
- Triple root systems, rational quivers and examples of linear free divisors
- A Moment Approach to Analyze Zeros of Triangular Polynomial Sets
- Algorithms for multivariate laurent series
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
This page was built for publication: Triangular systems and factorized Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352799)
