Book contents
- Frontmatter
- Contents
- Preface
- Programme Committee
- Tutorials
- Research Papers
- The Fractal Walk
- Gröbner Bases Property on Elimination Ideal in the Noncommutative Case
- 17 The CoCoA 3 Framework for a Family of Buchberger-like Algorithms
- 18 Newton Identities in the Multivariate Case: Pham Systems
- 19 Gröbner Bases in Rings of Differential Operators
- 20 Canonical Curves and the Petri Scheme
- 21 The Buchberger Algorithm as a Tool for Ideal Theory of Polynomial Rings in Constructive Mathematics
- 22 Gröbner Bases in Non-Commutative Reduction Rings
- 23 Effective Algorithms for Intrinsically Computing SAGBI-Gröbner Bases in a Polynomial Ring over a Field
- 24 De Nugis Groebnerialium 1: Eagon, Northcott, Gröbner
- 25 An application of Gröbner Bases to the Decomposition of Rational Mappings
- 26 On some Basic Applications of Gröbner Bases in Non-commutative Polynomial Rings
- 27 Full Factorial Designs and Distracted Fractions
- 28 Polynomial interpolation of Minimal Degree and Gröbner Bases
- 29 Inversion of Birational Maps with Gröbner Bases
- 30 Reverse Lexicographic Initial Ideals of Generic Ideals are Finitely Generated
- 31 Parallel Computation and Gröbner Bases: An Application for Converting Bases with the Gröbner Walk
- Appendix An Algorithmic Criterion for the Solvability of a System of Algebraic Equations (translated by Michael Abramson and Robert Lumbert)
- Index of Tutorials
22 - Gröbner Bases in Non-Commutative Reduction Rings
Published online by Cambridge University Press: 05 July 2011
- Frontmatter
- Contents
- Preface
- Programme Committee
- Tutorials
- Research Papers
- The Fractal Walk
- Gröbner Bases Property on Elimination Ideal in the Noncommutative Case
- 17 The CoCoA 3 Framework for a Family of Buchberger-like Algorithms
- 18 Newton Identities in the Multivariate Case: Pham Systems
- 19 Gröbner Bases in Rings of Differential Operators
- 20 Canonical Curves and the Petri Scheme
- 21 The Buchberger Algorithm as a Tool for Ideal Theory of Polynomial Rings in Constructive Mathematics
- 22 Gröbner Bases in Non-Commutative Reduction Rings
- 23 Effective Algorithms for Intrinsically Computing SAGBI-Gröbner Bases in a Polynomial Ring over a Field
- 24 De Nugis Groebnerialium 1: Eagon, Northcott, Gröbner
- 25 An application of Gröbner Bases to the Decomposition of Rational Mappings
- 26 On some Basic Applications of Gröbner Bases in Non-commutative Polynomial Rings
- 27 Full Factorial Designs and Distracted Fractions
- 28 Polynomial interpolation of Minimal Degree and Gröbner Bases
- 29 Inversion of Birational Maps with Gröbner Bases
- 30 Reverse Lexicographic Initial Ideals of Generic Ideals are Finitely Generated
- 31 Parallel Computation and Gröbner Bases: An Application for Converting Bases with the Gröbner Walk
- Appendix An Algorithmic Criterion for the Solvability of a System of Algebraic Equations (translated by Michael Abramson and Robert Lumbert)
- Index of Tutorials
Summary
Abstract
Gröbner bases of ideals in polynomial rings can be characterized by properties of reduction relations associated with ideal bases. Hence reduction rings can be seen as rings with reduction relations associated to subsets of the ring such that every finitely generated ideal has a finite Gröbner basis. This paper gives an axiomatic framework for studying reduction rings including non-commutative rings and explores when and how the property of being a reduction rings is preserved by standard ring constructions such as quotients and sums of reduction rings, and polynomial and monoid rings over reduction rings.
Introduction
Reasoning and computing in finitely presented algebraic structures is wide-spread in many fields in mathematics, physics and computer science. Reduction in the sense of simplification combined with appropriate completion methods is one general technique which is often successfully applied in this context, e.g. to solve the word problem and hence to compute effectively in the structure.
One fundamental application of this technique to polynomial rings was provided by B. Buchberger (1965) in his uniform effective solution of the ideal membership problem establishing the theory of Gröbner bases. These bases can be characterized in various manners, e.g. by properties of a reduction relation associated with polynomials (confluence or all elements in the ideal reduce to zero) or by special representations for the ideal elements with respect to a Gröbner basis (standard representations).
- Type
- Chapter
- Information
- Gröbner Bases and Applications , pp. 408 - 420Publisher: Cambridge University PressPrint publication year: 1998
- 2
- Cited by