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
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.