The discussion of parametric polynomial systems is an old and important problem in many technical and mathematical applications. To recall its importance it suffices to remember the well-known discussions of parametric linear systems and how useful they are for applications. However, many practical problems are associated to non-linear systems, in which the study of the nature of the solutions (i.e. no solution, finite number of solutions, degree of freedom of the solutions, etc) is very important depending on the values of the parameters. Since Gröbner bases were introduced, various approaches have been developed for this problem. Many authors have studied the subject during the last 15 years, among others we can highlight D. Lazard, D. Duval, P. Gianni, M. Kalkbrenner, V. Weispfenning, T. Mora, M. Moreno-Maza, L.Gonzalez-Vega, D. Kapur, D. Wang, Y. Sato, A. Suzuki, for the relevance of their contributions. The development of the subject of this thesis was initiated in 2000 with the first Montes' algorithm dispgb for discussing parametric polynomial systems using Gröbner bases, published in 2002 in the Journal of Symbolic Computation. Montes' algorithm has progressed from that moment, until the final obtention of the Minimal Canonical Comprehensive Gröbner System (MCCGS) of a parametric ideal. During the period 2003-2007 I had the great opportunity and pleasure to participate in this challenging project. My personal contribution to the project consisted of the implementation and improvement of a high number of algorithms that have conformed the evolution up to the current algorithm MCCGS, and updating the theory and algorithms that were initially disperse and partially incomplete. Given a polynomial system with parameters and a term order for the variables, the latest implementation of the algorithm MCCGS performs a discussion on the cancellation of some polynomials in the parameters. It obtains a set of ordered pairs consisting of a segment (constructible subset of the parameter space) and a basis (finite set of polynomials) such that the set of all segments forms a partition of the parameter space; for each pair, the substitution of the parameters in the basis by any value inside the corresponding segment, produces always the reduced Gröbner basis, with respect to the given term order, of the ideal generated by the substitution of the same values in the given polynomials; the segments are uniquely determined by the given system and term order and moreover they are described in a canonical form; the number of pairs in the obtained set is the minimum possible with these properties. All implementations have been done in Maple, and the last release 7.0 is currently available on the web http://www-ma2.upc.edu/~montes/, which integrates the improvements made on the original Montes' algorithm and the final MCCGS algorithm.
Read full abstract