Skip to main content

1999 | OriginalPaper | Buchkapitel

A New Criterion for Normal Form Algorithms

verfasst von : B. Mourrain

Erschienen in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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 S-polynomials. It leads to a newa lgorithm 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.

Metadaten
Titel
A New Criterion for Normal Form Algorithms
verfasst von
B. Mourrain
Copyright-Jahr
1999
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-46796-3_41

Neuer Inhalt