Details:
| Title | On Arithmetical Formulas Whose Jacobians are Groebner Bases | | Author(s) | Charles Denis, Kenneth Regan | | Type | Technical Report, Misc | | Abstract | We exhibit classes of polynomials whose sets of kth partial derivatives form Groebner bases for all k, with respect to all term orders. The classes are defined by syntactic constraints on arithmetical formulas defining the polynomials. Read-once formulas without constants have this property for all k, while those with constants have a weaker "Groebner-bounding" property introduced here. For k = 1 the same properties hold even with arbitrary powering of subterms of the formulas. |
| Language | English | | Number | 2000-07 | | Year | 2000 | | Edition | 0 | | Translation |
No | | Refereed |
No |
|
