Gröbner basis computation algorithms

  • José Bueso
  • José Gómez-Torrecillas
  • Alain Verschoren
Part of the Mathematical Modelling book series (MMTA, volume 17)

Abstract

In this chapter, we introduce most of the basic objects and tools that will be used throughout the rest of this book. We start with some background on the notion of admissible order ℕ n and show how this may be used to define left Poincaré-Birkhoff-Witt (PBW) rings. The elements of these rings exhibit a behaviour which is similar to that of ordinary, commutative polynomials, allowing them to be approached computationally. Left PBW rings are actually very nice algebras — they are left noetherian domains — and their class includes a vast amount of important instances, such as enveloping algebras of finite dimensional Lie algebras and iterated Ore extensions, which cover most “important” quantum groups. We will put particular emphasis on the division algorithm for these rings, as this will play a fundamental role when we introduce Gröbner bases for one-sided and two-sided ideals. We show how Buchberger’s approach generalizes to the noncommutative case. In particular, we will see that Gröbner bases always exist and that reduced Gröbner bases are unique.

Keywords

Partial Order Left Ideal Division Ring Division Algorithm Newton Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • José Bueso
    • 1
  • José Gómez-Torrecillas
    • 1
  • Alain Verschoren
    • 2
  1. 1.University of GranadaGranadaSpain
  2. 2.University of AntwerpAntwerpBelgium

Personalised recommendations