AbstractWe give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases in polynomial rings over commutative Von Neumann regular rings. Our comprehensive Gröbner bases are defined as Gröbner bases in polynomial rings over certain commutative Von Neumann regular rings, hence they have two important properties which do not hold in standard comprehensive Gröbner bases. One is that they have canonical forms in a natural way. Another one is that we can define monomial reductions which are compatible with any instantiation. Our comprehensive Gröbner bases are wider than Weispfenning’s original comprehensive Gröbner bases. That is there exists a polynomial ideal generated by our comprehensive Gröbner basis which cannot b...
AbstractGröbner bases are the computational method par excellence for studying polynomial systems. I...
Commutative Gröbner bases have a lot of applications in theory and practice, because they have many ...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
AbstractWe give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases i...
We showed special types of comprehensive Gröbner bases can be defined and calculated as the appli-c...
AbstractCommutative von Neumann regular rings can be viewed as certain subdirect products of fields....
AbstractComprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, a...
AbstractLet K be an integral domain and let S be the polynomial ring K[U1,.., Um; X1,.., Xn]. For an...
AbstractLet F be a set of polynomials in the variables __x=x1, . . . , xnwith coefficients in R [__ ...
AbstractThis article gives a short introduction to the theory of Gröbner bases in a class of rings, ...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here w...
AbstractGröbner bases as a means of studying ideals in polynomial rings have been generalized to oth...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
AbstractGröbner bases are the computational method par excellence for studying polynomial systems. I...
Commutative Gröbner bases have a lot of applications in theory and practice, because they have many ...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
AbstractWe give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases i...
We showed special types of comprehensive Gröbner bases can be defined and calculated as the appli-c...
AbstractCommutative von Neumann regular rings can be viewed as certain subdirect products of fields....
AbstractComprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, a...
AbstractLet K be an integral domain and let S be the polynomial ring K[U1,.., Um; X1,.., Xn]. For an...
AbstractLet F be a set of polynomials in the variables __x=x1, . . . , xnwith coefficients in R [__ ...
AbstractThis article gives a short introduction to the theory of Gröbner bases in a class of rings, ...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
Gröbner bases have been generalised to polynomials over a commutative ring A in several ways. Here w...
AbstractGröbner bases as a means of studying ideals in polynomial rings have been generalized to oth...
An ideal I in a polynomial ring k[x1, . . . ,xn] is a nonempty set which is closed under addition an...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
AbstractGröbner bases are the computational method par excellence for studying polynomial systems. I...
Commutative Gröbner bases have a lot of applications in theory and practice, because they have many ...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...