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

Details:

   
TitleA New Criterion for Normal Form Algorithms
Author(s) Bernard Mourrain
TypeArticle in Conference Proceedings
AbstractIn 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 S-polynomials. It leads to a new algorithm for constructing the multiplicative structure of a zero-dimensional algebra. Described in terms of intrinsic operations on vector spaces in the ring of polynomials, this algorithm extends naturally to Laurent polynomials.
Length14
File
LanguageEnglish
JournalLecture Notes in Computer Science
Volume1719
Pages430-443
PublisherSpringer Verlag
AddressBerlin
Year1999
EditorM. Fossorier, H. Imai, S. Lin and A. Poli
Edition0
Translation No
Refereed No
ConferencenameAAECC
Webmaster