Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleA new algorithm for discussing Gröbner bases with parameters
Author(s) Antonio Montes
TypeArticle in Journal
AbstractLet F be a set of polynomials in the variables __x = x1, . . . , xnwith coefficients in R [__ a ], where R is a UFD and __ a = a1, . . . ,am a set of parameters. In this paper we present a new algorithm for discussing Gröbner bases with parameters. The algorithm obtains all the cases over the parameters leading to different reduced Gröbner basis, when the parameters in F are substituted in an extension field K of R. This new algorithm improves Weispfenning‘s comprehensive Gröbner basis CGB algorithm, obtaining a reduced complete set of compatible and disjoint cases. A final improvement determines the minimal singular variety outside of which the Gröbner basis of the generic case specializes properly. These constructive methods provide a very satisfactory discussion and rich geometrical interpretation in the applications.
Length26
ISSN0747-7171
File
URL dx.doi.org/10.1006/jsco.2001.0504
LanguageEnglish
JournalJournal of Symbolic Computation
Volume33
Number2
Pages183-208
PublisherAcademic Press, Inc.
AddressDuluth, MN, USA
Year2002
MonthFebruary
Edition0
Translation No
Refereed No
Webmaster