Computing with Constructible Sets in Maple

Constructible sets are the geometrical objects naturally attached to triangular decompositions, as polynomial ideals are the algebraic concept underlying the computation of Grobner bases. This relation becomes even more complex and essential in the case of polynomial systems with infinitely many solutions. In this paper, we introduce ConstructibleSetTools a new module of the RegularChains library in Maple. To our knowledge, this is the first computer algebra package providing constructible set as a type and exporting a rich collection of operations for manipulating constructible sets. Besides, this module provides routines in support of solving parametric polynomial systems. Simplifying set-theoretical expressions on constructible sets is at the core of fundamental and challenging operations, like the removal of redundant components when decomposing a polynomial system. We present practically efficient approaches for this purpose together with an application to solver verification.

[1]  Changbo Chen,et al.  On the verification of polynomial system solvers , 2008, Frontiers of Computer Science in China.

[2]  Marc Moreno Maza,et al.  Computation of canonical forms for ternary cubics , 2002, ISSAC '02.

[3]  Antonio Montes,et al.  A New Algorithm for Discussing Gröbner Bases with Parameters , 2002, J. Symb. Comput..

[4]  Joyce O'Halloran,et al.  GROEBNER BASES FOR CONSTRUCTIBLE SETS , 2002 .

[5]  Jeffrey Shallit,et al.  Factor refinement , 1993, SODA '90.

[6]  Dongming Wang,et al.  Computing Triangular Systems and Regular Systems , 2000, J. Symb. Comput..

[7]  Peng Li,et al.  Proving Geometric Theorems by Partitioned-Parametric Gröbner Bases , 2004, Automated Deduction in Geometry.

[8]  Marc Moreno Maza,et al.  On the Theories of Triangular Sets , 1999, J. Symb. Comput..

[9]  Dongming Wang.  The Projection Property of Regular Systems and Its Application to Solving Parametric Polynomial Systems , 2005, Algorithmic Algebra and Logic.

[10]  Changbo Chen,et al.  Comprehensive Triangular Decomposition , 2007, CASC.

[11]  Xuefeng Chen,et al.  The Projection of Quasi Variety and Its Application on Geometric Theorem Proving and Formula Deduction , 2002, Automated Deduction in Geometry.

[12]  Hoon Hong,et al.  Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination , 1992, ISSAC '92.

[13]  Dongming Wang,et al.  Automated Deduction in Geometry , 1996, Lecture Notes in Computer Science.

[14]  Marc Moreno Maza,et al.  On the complexity of the D5 principle , 2005, SIGS.

[15]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[16]  Akira Suzuki,et al.  A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases , 2006, ISSAC '06.

[17]  Antonio Montes,et al.  Improving the DISPGB algorithm using the discriminant ideal , 2006, J. Symb. Comput..

[18]  Xiao-Shan Gao,et al.  Solving parametric algebraic systems , 1992, ISSAC '92.

[19]  Antonio Montes,et al.  Minimal canonical comprehensive Gröbner systems , 2006, J. Symb. Comput..

[20]  Michael Kalkbrener,et al.  A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..

[21]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[22]  Éric Schost,et al.  Sharp estimates for triangular sets , 2004, ISSAC '04.

[23]  Xiao-Shan Gao,et al.  ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS , 2003 .

[24]  Marc Moreno Maza,et al.  Polynomial Gcd Computations over Towers of Algebraic Extensions , 1995, AAECC.

[25]  Yang Lu.  Searching dependency between algebraic equations: an algorithm applied to automated reasoning , 1994 .

[26]  M. M. Maza.  On Triangular Decompositions of Algebraic Varieties , 2000 .

[27]  Peter Schauenburg.  A Gröbner-based treatment of elimination theory for affine varieties , 2007, J. Symb. Comput..

[28]  Dominique Duval,et al.  About a New Method for Computing in Algebraic Number Fields , 1985, European Conference on Computer Algebra.