Details:
Title  A New Criterion for Normal Form Algorithms  Author(s)  Bernard Mourrain  Type  Article in Conference Proceedings  Abstract  In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This criterion does not require any monomial ordering and generalizes the Buchberger criterion of Spolynomials. It leads to a new algorithm for constructing the multiplicative structure of a zerodimensional algebra. Described in terms of intrinsic operations on vector spaces in the ring of polynomials, this algorithm extends naturally to Laurent polynomials.  Length  14 
File 
 Language  English  Journal  Lecture Notes in Computer Science  Volume  1719  Pages  430443  Publisher  Springer Verlag  Address  Berlin  Year  1999  Editor  M. Fossorier, H. Imai, S. Lin and A. Poli  Edition  0  Translation 
No  Refereed 
No  Conferencename  AAECC 
