𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner Bases in Clifford and Grassmann algebras

✍ Scribed by David Hartley; Philip Tuckey

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
287 KB
Volume
20
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We give an account of the theory of Gröbner bases for Clifford and Grassmann algebras, both important in physical applications. We describe a characterization criterion tailored to these algebras which is significantly simpler than those given earlier or for more general non-commuting algebras. Our particular applications admit some tests for reducing the amount of calculation which are discussed along with an algorithm for calculating Gröbner bases in these algebras. Finally we describe a REDUCE implementation of our algorithm and give an application example.

📜 SIMILAR VOLUMES

Multiplicative Bases, Gröbner Bases, and
Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases
✍ Edward L. Green 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 314 KB

In this paper, we study conditions on algebras with multiplicative bases so that there is a Gröbner basis theory. We introduce right Gröbner bases for a class of modules. We give an elimination theory and intersection theory for right submodules of projective modules in path algebras. Solutions to h

Gröbner Bases in Orders of Algebraic Num
Gröbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g

Counting and Gröbner Bases
Counting and Gröbner Bases
✍ K. Kalorkoti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We show how the complexity of counting relates to the well known phenomenon that computing Gröbner bases under a lexicographic order is generally harder than total degree orders. We give simple examples of polynomials for which it is very easy to compute their Gröbner basis using a total degree orde

Gröbner–Shirshov Bases for Lie Superalge
Gröbner–Shirshov Bases for Lie Superalgebras and Their Universal Enveloping Algebras
✍ Leonid A Bokut; Seok-Jin Kang; Kyu-Hwan Lee; Peter Malcolmson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 231 KB

We show that a set of monic polynomials in a free Lie superalgebra is a Grobner᎐Shirshov basis for a Lie superalgebra if and only if it is a Grobner᎐Shirshov basis for its universal enveloping algebra. We investigate the structure of Grobner᎐Shirshov bases for Kac᎐Moody superalgebras and give ëxplic

Finite Lattices and Lexicographic Gröbne
Finite Lattices and Lexicographic Gröbner Bases
✍ Annetta Aramova; Jürgen Herzog; Takayuki Hibi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

By means of combinatorics on finite distributive lattices, lexicographic quadratic Gröbner bases of certain kinds of subrings of an affine semigroup ring arising from a finite distributive lattice will be studied.

Taylor and Lyubeznik Resolutions via Grö
Taylor and Lyubeznik Resolutions via Gröbner Bases
✍ Werner M. Seiler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that a subcomplex already defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Gröbner bases, whereas the Lyubeznik res