Involutive Algorithms for Computing Groebner Bases

Abstract

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Groebner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be output without any extra computational costs. We also discuss some accounts of experimental superiority of the involutive algorithm over Buchberger's algorithm.

27 pages, Proceedings of the NATO Advanced Research Workshop "Computational commutative and non-commutative algebraic geometry" (Chishinau, June 6-11, 2004), IOS Press, to appear

Cited by in corpus (10)

• Numerical Algebraic Geometry: A New Perspective on String and Gauge Theories
• Gröbner Bases and Generation of Difference Schemes for Partial Differential Equations
• Algorithmic Linearly Constrained Gaussian Processes
• New order bounds in differential elimination algorithms
• Linearly Constrained Gaussian Processes with Boundary Conditions
• On Computation of Groebner Bases for Linear Difference Systems
• On Computing Janet Bases for Degree Compatible Orderings
• Noncommutative Involutive Bases
• A Variant of Gerdt's Algorithm for Computing Involutive Bases
• Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems