Abstract
We show that the Buchberger algorithm for commutative polynomials over a field may be generalised to an algebraic structure which embeds such polymomials, the exterior polynomial algebra, and which is a natural domain for linear geometry. In particular, those finite sets of exterior polynomials which induce confluent reduction relations are characterised, and a means of algorithmically constructing them from a given set presented. A distinguished subset of such bases consists of the exterior algebra version of Gröbner bases. We characterise such bases and demonstrate how to construct them algorithmically from a given finite set of exterior polynomials.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bachmair, L and Buchberger, B., ‘A Simplified Proof of the Characterization Theorem for Gröbner Bases’, ACM-SIGSAM Bulletin 14(4) (1980) 29–34.
Buchberger, B., ‘A Theoretical Basis for the Reduction of Polynomials to Canonical Forms’, ACM-SIGSAM Bulletin 10(3) (1976) 19–27.
Buchberger, B., ‘Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory’, in Multidimensional Systems Theory (ed. N. K. Bose), D. Reidel, pp. 184–232 (1985).
Buchberger, B. and Loos, R., ‘Algebraic Simplification’, in Computer Algebra. Symbolic and Algebraic Computation (ed. B. Buchberger, B. G. Collins, R. Loos), Springer-Verlag, New York, pp. 11–43 (1983).
Fearnley-Sander, D., ‘The Idea of a Diagram’, in Resolution of Equations in Algebraic Structures, (eds. Hassan Ait-Kaçi and Maurice Nivat), Academic Press (1989).
Huet, G. and Oppen, D. C., Equations and Rewrite Rules: A Survey, Technical Report no. CSL-11, SRI International (1980).
Hungerford, T. W., Algebra, Holt, Rinehart and Winston (1974).
Kandri-Rody, A. and Weispfenning, V., ‘Non-Commutative Groebner Bases in Algebras of Solvable Type’, Technische Berichte der Fakultät für Mathematik und Informatik Universität Passau, MIP-8807 (1988).
Le Chenadec, P., Canonical Forms in Finitely Presented Algebras, Pitman, London (1986).
Mora, F., ‘Groebner Bases for Non-Commutative Polynomial Rings’, in 3rd International Conference, Algebraic Algorithms and Error Correcting Codes, Grenoble, France, July 15–29, 1985, Proceedings (ed. Jacques Calmet), Lecture Notes in Computer Science 229, Springer-Verlag, pp. 353–362 (1986).
Northcott, D. G., Lessons on Rings, Modules and Multiplicities, Cambridge University Press (1968).
White, N. L. and McMillan, T., ‘Cayley Factorization’, Institute for Mathematics and its Applications Preprint Series No. 371 (1987). To appear in Proceedings of International Symposium on Symbolic and Algebraic Computations (ed. A. Miola), Rome (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Stokes, T. Gröbner bases in exterior algebra. J Autom Reasoning 6, 233–250 (1990). https://doi.org/10.1007/BF00244487
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00244487