Triangular systems and factorized Gröbner bases (Q4352799)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1057751
Language Label Description Also known as
default for all languages
No label defined
    English
    Triangular systems and factorized Gröbner bases
    scientific article; zbMATH DE number 1057751

      Statements

      0 references
      10 March 1999
      0 references
      factorized Gröbner bases
      0 references
      triangular system
      0 references
      polynomial equations
      0 references
      triangular sets
      0 references
      zeros of polynomials
      0 references
      Triangular systems and factorized Gröbner bases (English)
      0 references
      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].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references