A theoretical basis for the reduction of polynomials to canonical forms

ABSTRACT

We define a certain type of bases of polynomial ideals whose usefulness stems from the fact that a number of computability problems in the theory of polynomial ideals (e.g. the problem of constructing canonical forms for polynomials) is reducible to the construction of bases of this type. We prove a characterization theorem for these bases which immediately leads to an effective method for their construction.

REFERENCES

• 1: B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nuildimensionalen Polynomideal, Dissertation, Universität Innsbruck, 1965.
• 2: B. Buchberger, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequationes mathematicae, Vol. 4/3, S. 374--383, 1970.
• 3: B. Buchberger, On Certain Bases of Polynomial ideals, Bericht Nr. 53, Institut für Mathematik, Universität Linz.
• 4: W. Gröbner, Personal communication, Seminar d. institutes für Mathematik, Universität Innsbruck, 1964.
• 5: Markus Lauer, Canonical representatives for residue classes of a polynomial ideal, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.339-345, August 10-12, 1976, Yorktown Heights, New York, United States [doi>10.1145/800205.806353]
• 6: Ruediger G. K. Loos, Toward a formal implementation of computer algebra, ACM SIGSAM Bulletin, v.8 n.3, p.9-16, August 1974 [doi>10.1145/1086837.1086839]
• 7: Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
• 8: R. Schrader, Diplomarbeit, Math. Institut, Universität Karlsruhe, 1976.