Abstract

Several variants of the classical theory of Grobner bases can be found in the literature. They come, depending on the structure they operate on, with their own specific peculiarity. Setting up an expedient reduction concept depends on the arithmetic equipment that is provided by the structure in question. Often it is necessary to introduce a term order that can be used for determining the orientation of the reduction, the choice of which might be a delicate task. But there are other situations where a different type of structure might give the appropriate basis for formulating adequate rewrite rules. In this paper we have tried to find a unified concept for dealing with such situations. We develop a global theory of Grobner bases for modules over a large class of rings. The method is axiomatic in that we demand properties that should be satisfied by a reduction process. Reduction concepts obeying the principles formulated in the axioms are then guaranteed to terminate. The class of rings we consider is large enough to subsume interesting candidates. Among others this class contains rings of differential operators, Ore-algebras and rings of difference-differential operators. The theory is general enough to embrace the well-known classical Grobner basis concepts of commutative algebra as well as several modern approaches for modules over relevant noncommutative rings. We start with introducing the appropriate axioms step by step, derive consequences from them and end up with the Buchberger Algorithm, that makes it possible to compute a Grobner basis. At the end of the paper we provide a few examples to illustrate the abstract concepts in concrete situations.

Highlights

  • The principal reason for studying Grobner bases is their utility when dealing with computational questions regarding submodules and quotient modules

  • In 2008, Winkler and Zhou extended their 2006-approach to the notion of relative Grobner bases and applied it to the computation of difference-differential dimension polynomials Splitting the set of derivations and the set of automorphisms, they provided algorithms for the univariate and the bivariate case [36, 37]

  • Given a module M and a submodule N ⊂ M, the goal of reduction is to compute a set of normal forms that allow to decide the membership problem for N

Read more

Summary

Introduction

The principal reason for studying Grobner bases is their utility when dealing with computational questions regarding submodules and quotient modules. In 2008, Winkler and Zhou extended their 2006-approach to the notion of relative Grobner bases and applied it to the computation of difference-differential dimension polynomials Splitting the set of derivations and the set of automorphisms, they provided algorithms for the univariate and the bivariate case [36, 37]. The Grobner basis concepts developed in the papers of Levin, Pauer, Winkler, Zhou for rings of differential operators, Ore algebras etc. In any concrete instance the spezialized concepts will incorporate the computational advantages that come from the specific equipment

Notation
The General Theory
Axiom 2
Axiom 1
Axiom 4
Well-founded Orders
Rings and Modules with Basis
Reduction in a Module with Basis
Term Orders
Classical Reduction
T-Reduction
Reduction for Finitely Generated Submodules
TO-pairs and Syzygies
The Buchberger Algorithm
Specialization to Particular Rings
Vector Spaces
Monoid Rings
Matrixrings
The Ring of Ore Polynomials
The Ring of Difference-Differential Operators
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call