L. Bachmair
Abstract
In /2/ a certain type of bases ("Gröbner-Bases") for polynomial ideals has been introduced whose usefulness stems from the fact that a number of important computability problems in the theory of polynomial ideals are reducible to the construction of bases of this type. The key to an algorithmic construction of Gröbner-bases is a characterization theorem for Gröbner-bases whose proof in /2/is rather complex.In this paper a simplified proof is given. The simplification is based on two new lemmas that are of some interest in themselves. The first lemma characterizes the congruence relation modulo a polynomial ideal as the reflexive-transitive closure of a particular reduction relation ("M-reduction") used in the definition of Gröbner-bases and its inverse. The second lemma is a lemma on general reduction relations, which allows to guarantee the Church-Rosser property under very weak assumptions.
- B. Buchberger, Ph.D. Thesis, Univ. Innsbruck, 1965 (see also Aequationes mathematicae, Vol. 4/3, pp. 374--383, 1970).Google Scholar
- B. Buchberger, A Theoretical Basis for the Reduction of Polynomials to Canonical Forms, ACM-SIGSAM Bulletin 39, August 1976, p. 19--29. Google ScholarDigital Library
- B. Buchberger, A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner-Bases, in: Proc. EUROSAM 79, Marseille, (Lecture Notes in Computer Science, Vol. 72), pp. 3--21, 1979. Google ScholarDigital Library
- B. Buchberger, F. Winkler, Miscellaneous Results on the Construction of Gröbner-Bases for Polynomial Ideals, Bericht Nr. 137, Institut für Mathematik, Universität Linz, 1979.Google Scholar
- G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, 18th IEEE Symp. on Found. Comp. Scie, 30--45, 1977.Google Scholar
- D. Knuth, P. Bendix, Simple word problems in universal algebras, Computational problems in abstract algebra, Ed. J. Leech, Pergamon Press, pp. 263--297, 1970.Google Scholar
- C. Kollreider, B. Buchberger, An Improved Algorithmic Construction of Gröbner-Bases for Polynomial Ideals, Bericht Nr. 110, Institut für Mathematik, Universität Linz, 1978.Google Scholar
- R. Loos, personal communication, 1979.Google Scholar
Recommendations
Canonical comprehensive Gröbner bases
Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems ALDES/SAC-2, MAS, REDUCE and MAPLE. A ...
Janet-like gröbner bases
CASC'05: Proceedings of the 8th international conference on Computer Algebra in Scientific ComputingWe define a new type of Gröbner bases called Janet-like, since their properties are similar to those for Janet bases. In particular, Janet-like bases also admit an explicit formula for the Hilbert function of polynomial ideals. Cardinality of a Janet-...
Letterplace ideals and non-commutative Gröbner bases
In this paper we propose a 1-to-1 correspondence between graded two-sided ideals of the free associative algebra and some class of ideals of the algebra of polynomials, whose variables are double-indexed commuting ones. We call these ideals the ''...
Comments